1822 search results - page 216 / 365 » The Method of Assigning Incidences |
195
Voted
CP
2007
Springer
16 years 1 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
183
Voted
STACS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
195
Voted
MM
2006
ACM
16 years 29 days ago
2006
ACM
Salient points are locations in an image where there is a significant variation with respect to a chosen image feature. Since the set of salient points in an image capture import...
201
click to vote
FMCAD
2004
Springer
15 years 10 months ago
2004
Springer
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
236
Voted
AAAI
1994
15 years 8 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...