Sciweavers

3758 search results - page 124 / 752
» A Complete Subsumption Algorithm
Sort
View
CSL
2007
Springer
15 years 4 months ago
Clique-Width and Parity Games
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
Jan Obdrzálek
ATAL
2005
Springer
15 years 3 months ago
Efficient information retrieval using mobile agents
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
Irene Sygkouna, Miltiades E. Anagnostou
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 10 months ago
Online Identification and Tracking of Subspaces from Highly Incomplete Information
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...
Laura Balzano, Robert Nowak, Benjamin Recht
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
15 years 4 months ago
Fast C-obstacle Query Computation for Motion Planning
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
ACIVS
2005
Springer
15 years 3 months ago
A Fast Sequential Rainfalling Watershed Segmentation Algorithm
Abstract. In this paper we present a new implementation of a rainfalling watershed segmentation algorithm. Our previous algorithm was a one-run algorithm. All the steps needed to c...
Johan de Bock, Patrick de Smet, Wilfried Philips