8413 search results - page 279 / 1683 » Ordering Problem Subgoals |
142
click to vote
AAAI
1994
15 years 7 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
162
click to vote
AIPS
2009
15 years 7 months ago
2009
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
127
click to vote
JNS
2010
15 years 5 months ago
2010
Quasipatterns (two-dimensional patterns that are quasiperiodic in any spatial direction) remain one of the outstanding problems of pattern formation. As with problems involving qu...
154
click to vote
CPAIOR
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
146
click to vote
CPM
2004
Springer
15 years 12 months ago
2004
Springer
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...