Showing 41 - 37 of 37

41

on the complexity of non preemptive shop scheduling with two jobs: On the complexity of non-preemptive shop scheduling with two jobs
Tamás Kis
Computing. 69(1):37-49

pseudo-polynomial time a... computational complexity Deterministic scheduling... mixed shop scheduling
Academic journal
Save to List
42

The complexity of mean payoff games on graphs
Uri Zwick ; Mike Paterson
Theoretical Computer Science. 158:343-359

pseudo-polynomial time a... 0209 industrial biotechn... Graph theory (including... polynomial reduction 0102 computer and inform... 02 engineering and techn...
Academic journal
Save to List
43

Discrete Optimal Transport with Independent Marginals is #P-Hard
Taskesen, Bahar ; Shafieezadeh Abadeh, Soroosh ; Kuhn, Daniel ; et al.

Optimal transport Wasserstein distance Complexity theory Pseudo-polynomial time a...
Academic journal
Save to List
44

Max-min weight balanced connected partition
Wang, Lele ; Zhang, Zhao ; Wu, Di ; et al.
Journal of Global Optimization: An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering. December 2013 57(4):1263-1275

Academic journal
Save to List
45

Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems
Shabtay, Dvir ; Bensoussan, Yaron
Journal of Scheduling. February 2012 15(1):39-47

Academic journal
Save to List
46

A primal‐dual algorithm for the minimum average weighted length circuit problem: A primal-dual algorithm for the minimum average weighted length circuit problem
Chengen Yang ; Dayong Jin
Networks. 21:705-712

pseudo-polynomial time a... 0211 other engineering a... minimum average weighted... 0102 computer and inform... 02 engineering and techn... Programming involving gr...
Academic journal
Save to List
47

Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights: Weighted-tardiness scheduling on parallel machines with proportional weights
Robin O. Roundy ; Esther M. Arkin
Operations Research. 39:64-81

Deterministic scheduling... single machine parallel machines total weighted tardiness Computational methods fo... heuristic
Academic journal
Save to List
48

Minimizing the number of late tasks with error constraint
C. S. Wong ; Joseph Y.-T. Leung
[1990] Proceedings 11th Real-Time Systems Symposium. :32-40

Deterministic scheduling... 02 engineering and techn... Theoretical Computer Sci... Computer Science Applica... imprecise computation mo... pseudo-polynomial time a...
Academic journal
Save to List
49

Spread of influence in weighted networks under time and budget constraints
Cicalese, Ferdinando ; Cordasco, Gennaro ; Gargano, Luisa ; et al.

Dynamic monopolie Exact pseudo-polynomial... Social network Spread of influence Viral marketing
Academic journal
Save to List
50

Schedulability of event-driven code blocks in real-time embedded systems
Lothar Thiele ; Samarjit Chakraborty ; Simon Künzli ; et al.
Proceedings of the 39th conference on Design automation - DAC '02. :616

0202 electrical engineer... approximate decision alg... control flow graph demand-bound function dynamic programming event-driven code block...
Academic journal
Save to List
51

Schedulability of event-driven code blocks in real-time embedded systems
Chakraborty, S. ; Erlebach, T. ; Kunzli, S. ; et al.

info:eu-repo/classificat... approximate decision alg... control flow graph demand-bound function dynamic programming event-driven code block...
Conference
Save to List
52

This result is not available to guest users.

53

Approximation for multi-knapsack problem
Zhang, Li'ang ; Li, Luyang ; Huang, Xiong

pseudo-polynomial time a... Analysis of algorithms a... polynomial-time approxim... Integer programming Parallel algorithms in c... multi-knapsack problem
Academic journal
Save to List
55

This result is not available to guest users.

56

This result is not available to guest users.

57

This result is not available to guest users.


Filter