Sciweavers

2181 search results - page 40 / 437
» The restriction scaffold problem
Sort
View
JCO
2002
96views more  JCO 2002»
13 years 8 months ago
On the Robust Single Machine Scheduling Problem
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
Jian Yang, Gang Yu
CP
2005
Springer
14 years 2 months ago
Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
Chris Houghton, David A. Cohen
IMECS
2007
13 years 10 months ago
Genetic Algorithms for the Nesting Problem in the Packing Industry
— The problem of parts nesting in plane areas is found in several industries, with restrictions and different objectives. Among these industries having this process they are pack...
Roberto Selow, Flavio Neves Junior, Heitor S. Lope...
TCS
2008
13 years 8 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
STOC
2002
ACM
115views Algorithms» more  STOC 2002»
14 years 9 months ago
Stability of load balancing algorithms in dynamic adversarial systems
In the dynamic load balancing problem, we seek to keep the job load roughly evenly distributed among the processors of a given network. The arrival and departure of jobs is modeled...
Elliot Anshelevich, David Kempe, Jon M. Kleinberg