Sciweavers

359 search results - page 25 / 72
» Order Scheduling Models: Hardness and Algorithms
Sort
View
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
13 years 9 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
HICSS
2005
IEEE
165views Biometrics» more  HICSS 2005»
14 years 1 months ago
A QoS Based Model for Supporting Multimedia Applications over Cellular IP
With the increasing use of real-time multimedia applications over IP networks, efficient use of resources, especially in wireless networks, is becoming a necessity. In order to ha...
Elwalid Sidahmed, Hesham H. Ali
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
13 years 11 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson
IHI
2010
169views Healthcare» more  IHI 2010»
13 years 2 months ago
Dynamic scheduling of emergency department resources
The processes carried out in a hospital emergency department can be thought of as structures of activities that require resources in order to execute. Costs are reduced when resou...
Junchao Xiao, Leon J. Osterweil, Qing Wang
COCOON
2005
Springer
14 years 1 months ago
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules
We consider the problem of scheduling on-line a sequence of degradable intervals in a set of k identical machines. Our objective is to find a schedule that maximizes simultaneousl...
Fabien Baille, Evripidis Bampis, Christian Lafores...