741 search results - page 44 / 149 » Robust Constraint Solving Using Multiple Heuristics |
119
click to vote
PPL
2010
14 years 8 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
114
click to vote
CVPR
2000
IEEE
16 years 4 months ago
2000
IEEE
Combining learning with vision techniques in interactive image retrieval has been an active research topic during the past few years. However, existing learning techniques either ...
153
click to vote
EVOW
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
108
click to vote
TAP
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Usage of combinatorial testing is wide spreading as an effective technique to reveal unintended feature interaction inside a given system. To this aim, test cases are con...
112
click to vote
CP
1995
Springer
15 years 5 months ago
1995
Springer
Abstract. We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We fi...