551 search results - page 12 / 111 » Continuous Search in Constraint Programming |
ICLP
1999
Springer
13 years 12 months ago
1999
Springer
A central service of a constraint programming system is search. In almost all constraint programming systems search is based on trailing, which is well understood and known to be ...
AAAI
2008
13 years 10 months ago
2008
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
CP
2003
Springer
14 years 25 days ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
IJCAI
1997
13 years 9 months ago
1997
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness m...