3367 search results - page 179 / 674 » Incremental assignment problem |
127
click to vote
ECAI
2006
Springer
15 years 7 months ago
2006
Springer
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
122
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...
141
Voted
JAR
2000
15 years 3 months ago
2000
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
126
click to vote
JAIR
2007
15 years 3 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
164
click to vote
ESE
2000
15 years 3 months ago
2000
Problem frames are a relatively new approach to requirements engineering, promising benefits not only in elicitation but also in subsequent design, by allowing their users to selec...