Sciweavers

514 search results - page 17 / 103
» Comparison of Face-To-Face and Distributed Presentations
Sort
View
DARS
2000
Springer
129views Robotics» more  DARS 2000»
15 years 8 months ago
Distributed Multi-Robot Localization
Abstract—In this paper we present a new approach to the problem of simultaneously localizing a group of mobile robots capable of sensing one another. Each of the robots collects ...
Stergios I. Roumeliotis, George A. Bekey
HPCA
1999
IEEE
15 years 8 months ago
Comparative Evaluation of Fine- and Coarse-Grain Approaches for Software Distributed Shared Memory
Symmetric multiprocessors (SMPs) connected with low-latency networks provide attractive building blocks for software distributed shared memory systems. Two distinct approaches hav...
Sandhya Dwarkadas, Kourosh Gharachorloo, Leonidas ...
BMCBI
2010
88views more  BMCBI 2010»
15 years 4 months ago
Robust probabilistic superposition and comparison of protein structures
Background: Protein structure comparison is a central issue in structural bioinformatics. The standard dissimilarity measure for protein structures is the root mean square deviati...
Martin Mechelke, Michael Habeck
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
15 years 10 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
EC
2007
167views ECommerce» more  EC 2007»
15 years 4 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud