Sciweavers

422 search results - page 36 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
ICRA
2003
IEEE
146views Robotics» more  ICRA 2003»
14 years 2 months ago
An atlas framework for scalable mapping
Abstract— This paper describes Atlas, a hybrid metrical/topological approach to SLAM that achieves efficient mapping of large-scale environments. The representation is a graph o...
Michael Bosse, Paul M. Newman, John J. Leonard, Ma...
BROADNETS
2004
IEEE
14 years 13 days ago
Random Asynchronous Wakeup Protocol for Sensor Networks
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...
Vamsi Paruchuri, Shivakumar Basavaraju, Arjan Durr...
INFOCOM
2003
IEEE
14 years 2 months ago
IP-Subnet Aware Routing in WDM Mesh Networks
Abstract— We explore the problem of routing bandwidth guaranteed paths in wavelength-routed, WDM optical mesh networks. A WDM mesh network offers great flexibility in dynamicall...
Swarup Acharya, Bhawna Gupta, Pankaj Risbood, Anur...
ACRI
2006
Springer
14 years 2 months ago
A Maze Routing Algorithm Based on Two Dimensional Cellular Automata
This paper propose a maze routing algorithm based on cellular automata. The aim of this algorithm is find the shortest path between the source cell and the target cell , so that th...
Shahram Golzari, Mohammad Reza Meybodi
COMCOM
2006
79views more  COMCOM 2006»
13 years 8 months ago
How many sensors for an acceptable breach detection probability?
Determining the required number of sensors to be deployed is a critical decision for surveillance wireless sensor networks. In this paper, we discuss the trade-off between the num...
Ertan Onur, Cem Ersoy, Hakan Deliç