Sciweavers

5911 search results - page 882 / 1183
» Annealing Sensor Networks
Sort
View
CEC
2009
IEEE
16 years 1 months ago
HyperNEAT controlled robots learn how to drive on roads in simulated environment
Abstract— In this paper we describe simulation of autonomous robots controlled by recurrent neural networks, which are evolved through indirect encoding using HyperNEAT algorithm...
Jan Drchal, Jan Koutník, Miroslav Snorek
GLOBECOM
2007
IEEE
16 years 1 months ago
Two Energy-Saving Schemes for Cooperative Transmission with Opportunistic Large Arrays
— An opportunistic large array (OLA) is a form of cooperative diversity in which a large group of simple, inexpensive relays or forwarding nodes operate without any mutual coordi...
Lakshmi V. Thanayankizil, Aravind Kailas, Mary Ann...
SENSYS
2006
ACM
16 years 18 days ago
Lazy cross-link removal for geographic routing
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, dis...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
MSWIM
2005
ACM
16 years 6 days ago
Towards resilient geographic routing in WSNs
In this paper, we consider the security of geographical forwarding (GF) – a class of algorithms widely used in ad hoc and sensor networks. In GF, neighbors exchange their locati...
Nael B. Abu-Ghazaleh, Kyoung-Don Kang, Ke Liu
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
15 years 10 months ago
Finding Mobile Data: Efficiency vs. Location Inaccuracy
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
Amotz Bar-Noy, Joanna Klukowska