Sciweavers

2252 search results - page 273 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
138
Voted
AI
2008
Springer
15 years 3 months ago
Theoretical analysis of singleton arc consistency and its extensions
Singleton arc consistency (SAC) is a consistency property that is simple to specify and is stronger than arc consistency. Algorithms have already been proposed to enforce SAC, but...
Christian Bessiere, Romuald Debruyne
IPL
2002
74views more  IPL 2002»
15 years 3 months ago
Restricted rotation distance between binary trees
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
Sean Cleary
103
Voted
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
15 years 2 months ago
On the complexity of optimal reconfiguration planning for modular reconfigurable robots
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
Feili Hou, Wei-Min Shen
114
Voted
CORR
2009
Springer
115views Education» more  CORR 2009»
15 years 1 months ago
Testing the Equivalence of Regular Languages
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
Marco Almeida, Nelma Moreira, Rogério Reis
163
Voted
CDC
2010
IEEE
152views Control Systems» more  CDC 2010»
14 years 10 months ago
Completely decentralised navigation of multiple unicycle agents with prioritisation and fault tolerance
Abstract-- We propose an algorithm for decentralised navigation of multiple independent agents, applicable to Robotics and Air Traffic Control (ATC). We present completely decentra...
Giannis P. Roussos, Kostas J. Kyriakopoulos