510 search results - page 29 / 102 » How Should We Solve Search Problems Privately |
GECCO
2011
Springer
12 years 11 months ago
2011
Springer
Novelty search is a recently proposed method for evolutionary computation designed to avoid the problem of deception, in which the fitness function guides the search process away...
IJCAI
2007
13 years 9 months ago
2007
Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for m...
HICSS
1999
IEEE
13 years 12 months ago
1999
IEEE
As access to hypermedia documents becomes generally available, it becomes increasingly important to understand how casual users search for information. We have studied search patt...
EUMAS
2006
13 years 9 months ago
2006
One of the major puzzles in performing multi-agent-based simulations is the validity of their results. Optimisation of simulation parameters can lead to results that can be deceit...
CG
2010
Springer
13 years 5 months ago
2010
Springer
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...