438 search results - page 42 / 88 » New Search Heuristics for Max-CSP |
CONSTRAINTS
2007
14 years 9 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
COR
2010
14 years 9 months ago
2010
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
IROS
2007
IEEE
15 years 3 months ago
2007
IEEE
– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...
TIME
2002
IEEE
15 years 2 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
CONSTRAINTS
2007
14 years 9 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...