Sciweavers

1983 search results - page 92 / 397
» Competitive graph searches
Sort
View
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
13 years 9 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
JAIR
2006
120views more  JAIR 2006»
13 years 7 months ago
FluCaP: A Heuristic Search Planner for First-Order MDPs
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating stat...
Steffen Hölldobler, Eldar Karabaev, Olga Skvo...
ICCV
2005
IEEE
14 years 9 months ago
Learning Object Categories from Google's Image Search
Current approaches to object category recognition require datasets of training images to be manually prepared, with varying degrees of supervision. We present an approach that can...
Robert Fergus, Fei-Fei Li 0002, Pietro Perona, And...
24
Voted
GECCO
2005
Springer
122views Optimization» more  GECCO 2005»
14 years 1 months ago
An enhanced GA to improve the search process reliability in tuning of control systems
Evolutionary Algorithms (EAs) have been largely applied to optimisation and synthesis of controllers. In spite of several successful applications and competitive solutions, the st...
Andrea Soltoggio
AAAI
2000
13 years 9 months ago
Human-Guided Simple Search
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...