2657 search results - page 228 / 532 » On the complexity of hierarchical problem solving |
107
click to vote
BIBE
2007
IEEE
15 years 8 months ago
2007
IEEE
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
108
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
115
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...
112
click to vote
FLAIRS
2004
15 years 3 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
115
click to vote
IJCAI
1997
15 years 3 months ago
1997
Planning for real-time applications involves decisions not only about what actions to take in what states to progress toward achieving goals (the traditional decision problem face...