1041 search results - page 46 / 209 » Randomizing Reductions of Search Problems |
FLAIRS
2007
13 years 11 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
AAAI
2011
12 years 9 months ago
2011
Previous research in Artificial Intelligence has identified the possibility of simplifying planning problems via the identification and exploitation of symmetries. We advance t...
ESANN
2007
13 years 10 months ago
2007
In many applications, one is interested to detect certain patterns in random process signals. We consider a class of random process signals which contain sub similarities at rando...
GCC
2003
Springer
14 years 2 months ago
2003
Springer
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
FLAIRS
2004
13 years 10 months ago
2004
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...