Searching for authors named "Joel Wein" – sorted by Relevance.
-
Approximating the Minimum-Cost Maximum Flow is P-Complete
- for Computer Science MIT Cambridge, MA Joel Wein y Department of Computer Science Polytechnic University
- Cited by 1 (0 self) – Add To MetaCart
-
On the Relationship between Combinatorial and LP-Based Approaches to NP-hard Scheduling Problems (Extended Abstract)
- (Extended Abstract) R. N. Uma ? and Joel Wein ?? Polytechnic University Abstract. Enumerative approaches
- Cited by 8 (1 self) – Add To MetaCart
-
On the Existence of Schedules that are Near-Optimal for both Makespan and Total Weighted Completion Time
- Time Cliff Stein Joel Wein y June 19, 1996 Abstract We give a simple proof that, for any instance
- Cited by 25 (5 self) – Add To MetaCart
-
Distributed Job Scheduling in Rings Perry Fizzano
- of Computer Science Joel Wein x Polytechnic University Department of Computer Science ? Research partially
- Add To MetaCart
-
Distributed Job Scheduling in Rings Perry Fizzano
- Dartmouth College Department of Computer Science Joel Wein x Polytechnic University Department
- Add To MetaCart
-
Distributed Job Scheduling in Rings
- Dartmouth College, Department of Computer Science Joel Wein x Polytechnic University, Department
- Add To MetaCart
-
Job Scheduling in Rings
- Department of Math and CS Dartmouth College Hanover, NH Joel Wein x Department of Computer Science
- Cited by 9 (2 self) – Add To MetaCart
-
Scheduling Algorithms
- College Joel Wein, Polytechnic University 1 Introduction Scheduling theory is concerned with the optimal
- Cited by 35 (0 self) – Add To MetaCart
-
Task Scheduling In Networks
- TASK SCHEDULING IN NETWORKS # CYNTHIA PHILLIPS + , CLIFFORD STEIN # , AND JOEL WEIN SIAM J
- Cited by 22 (9 self) – Add To MetaCart
-
Experience with some principles for building an internet-scale reliable system
- Experience with some Principles for Building an Internet-Scale Reliable System Mike Afergan Joel
- Cited by 3 (0 self) – Add To MetaCart

