Sciweavers

4229 search results - page 186 / 846
» On the Optimality of Spiral Search
Sort
View
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
15 years 6 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
IRFC
2010
Springer
15 years 6 months ago
Knowledge Modeling in Prior Art Search
This study explores the benefits of integrating knowledge representations in prior art patent retrieval. Key to the introduced approach is the utilization of human judgment availa...
Erik Graf, Ingo Frommholz, Mounia Lalmas, Keith va...
ATAL
2006
Springer
15 years 5 months ago
Information-theoretic approaches to branching in search
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
Andrew Gilpin, Tuomas Sandholm
AISB
1995
Springer
15 years 5 months ago
The Ant Colony Metaphor for Searching Continuous Design Spaces
This paper describes a form of dynamical computational system--4he ant colony---and presents an ant colony model for continuous space optimisation problems. The ant colony metapho...
George Bilchev, Ian C. Parmee
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 2 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee