Sciweavers

9119 search results - page 255 / 1824
» A Simultaneous Search Problem
Sort
View
JPDC
2002
104views more  JPDC 2002»
15 years 6 months ago
Fully dynamic distributed search trees can be balanced in O(lg2 N) time
In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...
Fabio Barillari, Enrico Nardelli, Massimo Pepe
GECCO
2007
Springer
437views Optimization» more  GECCO 2007»
16 years 23 days ago
A gestalt genetic algorithm: less details for better search
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
Christophe Philemotte, Hugues Bersini
ENDM
2010
91views more  ENDM 2010»
15 years 4 months ago
Climbing discrepancy search for flowshop and jobshop scheduling with time lags
This paper addresses the jobshop and the flowshop scheduling problems with minimum and maximum time lags. To solve this kind of problems, we propose adaptations of Climbing Discre...
Wafa Karoui, Marie-José Huguet, Pierre Lope...
ICRA
2003
IEEE
126views Robotics» more  ICRA 2003»
15 years 12 months ago
Results for outdoor-SLAM using sparse extended information filters
Abstract — In [13], a new algorithm was proposed for efficiently solving the simultaneous localization and mapping (SLAM) problem. In this paper, we extend this algorithm to han...
Yufeng Liu, Sebastian Thrun
WG
2000
Springer
15 years 10 months ago
Budget Constrained Minimum Cost Connected Medians
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
Goran Konjevod, Sven Oliver Krumke, Madhav V. Mara...