330 search results - page 23 / 66 » Diagnosing and Solving Over-Determined Constraint Satisfacti... |
102
click to vote
CP
1995
Springer
15 years 5 months ago
1995
Springer
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
129
click to vote
PRICAI
2004
Springer
15 years 7 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...
102
click to vote
AAAI
2007
15 years 4 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
133
Voted
AAAI
2006
15 years 3 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
KCAP
2005
ACM
15 years 7 months ago
2005
ACM
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...