Sciweavers

902 search results - page 15 / 181
» R* Search
Sort
View
EVOW
2009
Springer
14 years 2 months ago
Binary Exponential Back Off for Tabu Tenure in Hyperheuristics
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...
Stephen Remde, Keshav P. Dahal, Peter I. Cowling, ...
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 8 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
CVPR
2010
IEEE
13 years 6 months ago
Nonparametric Label-to-Region by Search
In this work, we investigate how to propagate annotated labels for a given single image from the image-level to their corresponding semantic regions, namely Label-toRegion (L2R), ...
Xiaobai Liu, Shuicheng Yan, Jiebo Luo
DL
1998
Springer
113views Digital Library» more  DL 1998»
13 years 11 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...
COMBINATORICA
2006
64views more  COMBINATORICA 2006»
13 years 7 months ago
On The Parameterized Intractability Of Motif Search Problems
ended abstract of this paper was presented at the 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002), Springer-Verlag, LNCS 2285, pages 262
Michael R. Fellows, Jens Gramm, Rolf Niedermeier