417 search results - page 50 / 84 » In Search of the Best Constraint Satisfaction Search |
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract- This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The propo...
104
click to vote
SIGMOD
2010
ACM
14 years 10 months ago
2010
ACM
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
IAT
2007
IEEE
15 years 4 months ago
2007
IEEE
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
PETRA
2009
ACM
15 years 4 months ago
2009
ACM
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
CP
2006
Springer
15 years 1 months ago
2006
Springer
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...