2410 search results - page 103 / 482 » Multiset Ordering Constraints |
145
Voted
CEC
2009
IEEE
15 years 9 months ago
2009
IEEE
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
136
click to vote
AAAI
2008
15 years 7 months ago
2008
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
160
click to vote
FLAIRS
2007
15 years 7 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
130
Voted
AIPS
2009
15 years 6 months ago
2009
Recently, Helmert and Geffner proposed the context-enhanced additive heuristic, where fact costs are evaluated relative to context states that arise from achieving first a pivot c...
145
Voted
JAIR
2008
15 years 5 months ago
2008
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custom...