Sciweavers

127 search results - page 20 / 26
» The Directed Planar Reachability Problem
Sort
View
AINA
2010
IEEE
14 years 2 months ago
Iterative Route Discovery in AODV
Abstract—Several protocols for ad hoc network try to reduce redundancy as an effective measure against broadcast problems. Though these protocols ensure good performance in a fav...
Nashid Shahriar, Syed Ashker Ibne Mujib, Arup Rato...
SPIN
2010
Springer
13 years 8 months ago
Analysing Mu-Calculus Properties of Pushdown Systems
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
Matthew Hague, C.-H. Luke Ong
DAGSTUHL
2006
13 years 11 months ago
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems
In this paper we study a class of dynamical systems defined by Pfaffian maps. It is a sub-class of o-minimal dynamical systems which capture rich continuous dynamics and yet can be...
Margarita V. Korovina, Nicolai Vorobjov
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
14 years 4 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
COSIT
2003
Springer
132views GIS» more  COSIT 2003»
14 years 3 months ago
"Simplest" Paths: Automated Route Selection for Navigation
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
Matt Duckham, Lars Kulik