Sciweavers

4198 search results - page 188 / 840
» In search of lost time
Sort
View
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 10 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini
ROBOCOMM
2007
IEEE
16 years 26 days ago
Achieving connectivity through coalescence in mobile robot networks
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
Sameera Poduri, Gaurav S. Sukhatme
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
16 years 6 days ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
3DIM
2003
IEEE
15 years 10 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
ERCIMDL
2010
Springer
132views Education» more  ERCIMDL 2010»
15 years 6 months ago
A Visual Digital Library Approach for Time-Oriented Scientific Primary Data
Abstract. Digital Library support for textual and certain types of nontextual documents has significantly advanced over the last years. While Digital Library support implies many a...
Jürgen Bernard, Jan Brase, Dieter W. Fellner,...