5316 search results - page 280 / 1064 » Which Search Problems Are Random |
134
Voted
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Disambiguating person names in a set of documents (such as a set of web pages returned in response to a person name) is a key task for the presentation of results and the automatic...
146
Voted
MICAI
2005
Springer
15 years 10 months ago
2005
Springer
Particle Swarm Optimization (PSO) technique has proved its ability to deal with very complicated optimization and search problems. Several variants of the original algorithm have b...
121
click to vote
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
181
click to vote
INFOSCALE
2007
ACM
15 years 6 months ago
2007
ACM
Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the inverted index among a set of parallel server nodes. In this paper we are interested ...
145
Voted
AIPS
2009
15 years 6 months ago
2009
PDDL2.1 supports modelling of complex temporal planning domains in which solutions must exploit concurrency. Few existing temporal planners can solve problems that require concurr...