4112 search results - page 118 / 823 » Efficient Algorithms for the Spoonerism Problem |
114
click to vote
CG
2002
Springer
15 years 4 months ago
2002
Springer
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
136
click to vote
AIPS
2008
15 years 6 months ago
2008
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
138
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
156
click to vote
CATS
2006
15 years 5 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
127
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...