13090 search results - page 2456 / 2618 » Usable artificial intelligence |
150
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
147
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...
150
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
149
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Mechanism design is the art of designing the rules of the game (aka. mechanism) so that a desirable outcome (according to a given objective) is reached despite the fact that each a...
136
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...