Sciweavers

451 search results - page 77 / 91
» Some Lower Bounds on Geometric Separability Problems
Sort
View
ICRA
2005
IEEE
117views Robotics» more  ICRA 2005»
15 years 3 months ago
CBUG: A Quadratically Competitive Mobile Robot Navigation Algorithm
Abstract This paper is concerned with the problem where a mobile robot of size D has to navigate to a target in an unknown planar environment. The competitiveness of an on-line nav...
Yoav Gabriely, Elon Rimon
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
14 years 10 months ago
Precision, local search and unimodal functions
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wege...
IJAHUC
2007
111views more  IJAHUC 2007»
14 years 9 months ago
Configuring node status in a two-phase tightly integrated mode for wireless sensor networks
: In wireless sensor networks, one of the main design challenges is to save severely constrained energy resources and obtain a long system lifetime. Low cost of sensors enables us ...
Di Tian, Zhijun Lei, Nicolas D. Georganas
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
15 years 4 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
ISTCS
1993
Springer
15 years 1 months ago
Analog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
Hava T. Siegelmann, Eduardo D. Sontag