1171 search results - page 82 / 235 » Variable neighborhood search |
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
FLAIRS
2004
14 years 11 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
PAMI
2006
14 years 9 months ago
2006
A visual search is required when applying a recognition process on a scene containing multiple objects. In such cases, we would like to avoid an exhaustive sequential search. This...
ICML
1990
IEEE
15 years 1 months ago
1990
IEEE
Decision trees that are limited to testing a single variable at a node are potentially much larger than trees that allow testing multiple variables at a node. This limitation redu...
FLAIRS
2008
15 years 2 days ago
2008
Reasoning with conditional time-intervals representing activities or tasks that may or may not be executed in the final schedule is crucial in many scheduling applications. In Con...