805 search results - page 69 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
148
click to vote
IEAAIE
2001
Springer
15 years 10 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
173
click to vote
PRICAI
2004
Springer
15 years 11 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
160
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
184
click to vote
AAAI
2000
15 years 7 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
177
click to vote
AI
1999
Springer
15 years 5 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...