233 search results - page 4 / 47 » CAPTCHA: Using Hard AI Problems for Security |
CP
2010
Springer
13 years 3 months ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
AI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Choosing between multiple alternative tasks is a hard problem for agents evolving in an uncertain real-time multiagent environment. An example of such environment is the ...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
IJCAI
2003
13 years 6 months ago
2003
In most real-world settings, due to limited time or other resources, an agent cannot perform all potentially useful deliberation and information gathering actions. This leads to t...
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...