7 search results - page 1 / 2 » Towards Provably Complete Stochastic Search Algorithms for S... |
EPIA
2001
Springer
13 years 9 months ago
2001
Springer
IJCAI
2001
13 years 6 months ago
2001
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
AI
1999
Springer
13 years 4 months ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
NIPS
2007
13 years 6 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
CCS
2008
ACM
13 years 7 months ago
2008
ACM
To ensure that a trust negotiation succeeds whenever possible, authorization policy compliance checkers must be able to find all minimal sets of their owners' credentials tha...