Sciweavers

133 search results - page 12 / 27
» DIJKSTRA
Sort
View
GLOBECOM
2006
IEEE
14 years 1 months ago
Optimal Routing in the Worst-Case-Error Metric
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
Edwin Soedarmadji
IPCCC
2006
IEEE
14 years 1 months ago
Energy-efficient cooperative routing in multi-hop wireless ad hoc networks
We study the routing problem for multi-hop wireless ad hoc networks based on cooperative transmission. We prove that the Minimum Energy Cooperative Path (MECP) routing problem, i....
Fulu Li, Kui Wu, Andrew Lippman
ISCIS
2004
Springer
14 years 1 months ago
Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...
ICRA
2003
IEEE
120views Robotics» more  ICRA 2003»
14 years 29 days ago
Extracting optimal paths from roadmaps for motion planning
We present methods for extracting optimal paths from motion planning roadmaps. Our system enables any combination of optimization criteria, such as collision detection, kinematic/...
Jinsuck Kim, Roger A. Pearce, Nancy M. Amato
ACRI
2000
Springer
14 years 1 days ago
A Multi-Agent Cellular Automata System for Visualising Simulated Pedestrian Activity
This paper describes the first impressions of the development of a multi-agent system that can be used for visualising simulated pedestrian activity and behaviour to support the a...
J. Dijkstra, Harry J. P. Timmermans, J. Jessurun