417 search results - page 20 / 84 » In Search of the Best Constraint Satisfaction Search |
SAC
2005
ACM
15 years 5 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
137
click to vote
CONSTRAINTS
1998
14 years 11 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
116
click to vote
CONSTRAINTS
2010
14 years 12 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
JAIR
2000
14 years 11 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
WWW
2009
ACM
16 years 14 days ago
2009
ACM
Both search engine click-through log and social annotation have been utilized as user feedback for search result re-ranking. However, to our best knowledge, no previous study has ...