54 search results - page 7 / 11 » Local-Search Techniques for Boolean Combinations of Pseudo-B... |
TEC
2002
13 years 7 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
CP
2004
Springer
14 years 23 days ago
2004
Springer
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem...
ANOR
2002
13 years 7 months ago
2002
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
CAV
2003
Springer
14 years 18 days ago
2003
Springer
Run-time monitoring of temporal properties and assertions is used for testing and as a component of execution-based model checking techniques. Traditional run-time monitoring howev...
AAAI
1998
13 years 8 months ago
1998
In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...