Sciweavers

658 search results - page 74 / 132
» Partially Ordered Constraint Optimization Problems
Sort
View
COR
2010
129views more  COR 2010»
14 years 8 months ago
Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work i...
Mohamed Ali Aloulou, Christian Artigues
CPAIOR
2009
Springer
15 years 4 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
15 years 10 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
GECCO
2003
Springer
162views Optimization» more  GECCO 2003»
15 years 3 months ago
Optimization of Spare Capacity in Survivable WDM Networks
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
H. W. Chong, Sam Kwong
ATAL
2004
Springer
15 years 3 months ago
Communication for Improving Policy Computation in Distributed POMDPs
Distributed Partially Observable Markov Decision Problems (POMDPs) are emerging as a popular approach for modeling multiagent teamwork where a group of agents work together to joi...
Ranjit Nair, Milind Tambe, Maayan Roth, Makoto Yok...