Sciweavers

2089 search results - page 2 / 418
» Finding Environment Guarantees
Sort
View
DAGSTUHL
1994
13 years 6 months ago
Competitive Strategies for Autonomous Systems
A strategy for working with incomplete information is called competitive if it solves each problem instance at a cost not exceeding the cost of an optimal solution (with full info...
Christian Icking, Rolf Klein
COMPGEOM
2008
ACM
13 years 7 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
FIW
2007
120views Communications» more  FIW 2007»
13 years 6 months ago
How to Guarantee Service Cooperation in Dynamic Environments?
The rise of communicating devices has led to more and more machine to machine applications. In this context devices can be modeled using serviceoriented computing. Furthermore serv...
Lionel Touseau
ADHOCNOW
2009
Springer
13 years 6 months ago
Localized Sensor Self-deployment with Coverage Guarantee in Complex Environment
Abstract. In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has h...
Xu Li, Nathalie Mitton, Isabelle Ryl, David Simplo...
CDC
2010
IEEE
111views Control Systems» more  CDC 2010»
13 years 8 days ago
Multi-robot monitoring in dynamic environments with guaranteed currency of observations
Abstract-- In this paper we consider the problem of monitoring a known set of stationary features (or locations of interest) in an environment. To observe a feature, a robot must v...
Stephen L. Smith, Daniela Rus