1639 search results - page 107 / 328 » Anytime Heuristic Search |
85
Voted
FLAIRS
2006
15 years 2 months ago
2006
The goal of this paper is to propose a tabu search heuristic for the car sequencing problem (CSP) used for the ROADEF 2005 international Challenge. This NP-hard problem was propos...
121
click to vote
JWSR
2006
15 years 18 days ago
2006
: We investigate architectural properties required for supporting automatic service composition. First, composable service architecture will be described, based on modeling Web ser...
103
click to vote
BIBE
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract—Recent improvements in high-throughput genotyping technology make possible genome-wide association studies and status prediction (classification) for common complex dis...
CADE
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods. One approach consists in statically rewriting ...
127
Voted
FLAIRS
2004
15 years 2 months ago
2004
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...