706 search results - page 1 / 142 » Super Solutions in Constraint Programming |
CPAIOR
2004
Springer
13 years 10 months ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
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 ...
CSCLP
2004
Springer
13 years 10 months ago
2004
Springer
Super solutions provide a framework for finding robust solutions to Constraint Satisfaction Problems [5, 3]. We present a novel application of super solutions to combinatorial auc...
CP
2009
Springer
14 years 5 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...