Sciweavers

175 search results - page 23 / 35
» Approximation Algorithms for Flexible Job Shop Problems
Sort
View
ECAI
2004
Springer
14 years 1 months ago
Robust Solutions for Constraint Satisfaction and Optimization
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
Emmanuel Hebrard, Brahim Hnich, Toby Walsh
MP
2007
145views more  MP 2007»
13 years 7 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
GECCO
2005
Springer
193views Optimization» more  GECCO 2005»
14 years 1 months ago
On the contribution of gene libraries to artificial immune systems
Gene libraries have been added to Artificial Immune Systems in analogy to biological immune systems, but to date no careful study of their effect has been made. This work investig...
Peter Spellward, Tim Kovacs
EDBT
2009
ACM
118views Database» more  EDBT 2009»
14 years 2 months ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...
STACS
2004
Springer
14 years 28 days ago
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...