Sciweavers

5580 search results - page 346 / 1116
» Randomized priority algorithms
Sort
View
IROS
2009
IEEE
261views Robotics» more  IROS 2009»
16 years 1 months ago
Probabilistic motion planning among moving obstacles following typical motion patterns
— The paper presents a navigation algorithm for dynamic, uncertain environment. The static environment is unknown, while moving pedestrians are detected and tracked on-line. Pede...
Chiara Fulgenzi, Anne Spalanzani, Christian Laugie...
WDAG
2005
Springer
130views Algorithms» more  WDAG 2005»
16 years 17 days ago
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger...
218
Voted
DAGM
2008
Springer
15 years 8 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr
GECCO
2005
Springer
152views Optimization» more  GECCO 2005»
16 years 18 days ago
Multi-level genetic algorithm (MLGA) for the construction of clock binary tree
The clock signal and clock skew become more and more important for the circuit performance. Since there are salient shortcomings in the conventional topology construction algorith...
Guofang Nan, Minqiang Li, Jisong Kou
202
Voted
IJCAI
2003
15 years 8 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings