2263 search results - page 270 / 453 » On learning in agent-centered search |
196
click to vote
MM
2009
ACM
16 years 1 months ago
2009
ACM
The amount of multimedia content available online constantly increases, and this leads to problems for users who search for content or similar communities. Users in Flickr often s...
190
click to vote
ICTAI
2007
IEEE
16 years 25 days ago
2007
IEEE
Lookahead is a well-known constraint propagation technique for DPLL-based SAT and answer set solvers. Despite its space pruning power, it can also slow down the search, due to its...
202
click to vote
ATAL
2007
Springer
16 years 22 days ago
2007
Springer
The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful...
159
click to vote
EGC
2005
Springer
16 years 2 days ago
2005
Springer
Genetic algorithms (GAs) are stochastic search methods that have been successfully applied in many search, optimization, and machine learning problems. Their parallel counterpart (...
177
click to vote
GECCO
2005
Springer
16 years 2 days ago
2005
Springer
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...