5316 search results - page 344 / 1064 » Which Search Problems Are Random |
173
Voted
CG
2000
Springer
15 years 11 months ago
2000
Springer
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
212
Voted
PRICAI
2010
Springer
15 years 5 months ago
2010
Springer
Relational search is a novel paradigm of search which focuses on the similarity between semantic relations. Given three words (A, B, C) as the query, a relational search engine ret...
188
Voted
AIPS
2008
15 years 9 months ago
2008
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
203
Voted
GECCO
2003
Springer
16 years 18 days ago
2003
Springer
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
221
click to vote
ICWS
2010
IEEE
15 years 8 months ago
2010
IEEE
Web services are becoming prevalent nowadays. Finding desired Web services is becoming an emergent and challenging research problem. In this paper, we present WSExpress (Web Servi...