151 search results - page 10 / 31 » A CSP Search Algorithm with Reduced Branching Factor |
IJCAI
2001
13 years 9 months ago
2001
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...
FLAIRS
2004
13 years 9 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
IUI
2006
ACM
14 years 1 months ago
2006
ACM
Helping computer users rapidly locate files in their folder hierarchies has become an important research topic in today’s intelligent user interface design. This paper reports o...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Generating test data for Object-Oriented (OO) software is a hard task. Little work has been done on the subject, and a lot of open problems still need to be investigated. In th...
PLILP
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...