Sciweavers

2715 search results - page 190 / 543
» Total Generalized Variation
Sort
View
134
Voted
COMGEO
1998
ACM
15 years 3 months ago
The union of moving polygonal pseudodiscs - Combinatorial bounds and applications
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
Mark de Berg, Hazel Everett, Leonidas J. Guibas
120
Voted
AUTOMATICA
1999
96views more  AUTOMATICA 1999»
15 years 3 months ago
Optimization of kanban-based manufacturing systems
We develop and analyze an algorithm to maximize the throughput of a serial kanbanbased manufacturing system with arbitrary arrival and service process distributions by adjusting t...
Christos G. Panayiotou, Christos G. Cassandras
135
Voted
TCAD
1998
95views more  TCAD 1998»
15 years 3 months ago
A framework for comparing models of computation
—We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general term...
Edward A. Lee, Alberto L. Sangiovanni-Vincentelli
133
Voted
FSTTCS
2010
Springer
15 years 1 months ago
Minimizing Busy Time in Multiple Machine Real-time Scheduling
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, ...
109
Voted
WIOPT
2010
IEEE
15 years 1 months ago
Delay efficient scheduling via redundant constraints in multihop networks
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
Longbo Huang, Michael J. Neely