Sciweavers

3514 search results - page 77 / 703
» A search space
Sort
View
DL
1998
Springer
113views Digital Library» more  DL 1998»
14 years 2 months ago
Efficient Searching in Distributed Digital Libraries
When a digital library is decomposed into many geographically distributed repositories,searchefficiencybecomesan issue. Increasing network congestion makes this a compelling issue...
James C. French, Allison L. Powell, Walter R. Crei...
GECCO
2004
Springer
14 years 3 months ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter
ECIR
2006
Springer
13 years 11 months ago
Beyond the Web: Retrieval in Social Information Spaces
We research whether the inclusion of information about an information user's social environment and his position in the social network of his peers leads to an improval in sea...
Sebastian Marius Kirsch, Melanie Gnasa, Armin B. C...
CEC
2010
IEEE
13 years 6 months ago
Differential evolution with ensemble of constraint handling techniques for solving CEC 2010 benchmark problems
Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single c...
Rammohan Mallipeddi, Ponnuthurai Nagaratnam Sugant...
FOCS
2008
IEEE
14 years 4 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder