Sciweavers

4403 search results - page 303 / 881
» Galois Theory of Algorithms
Sort
View
ICRA
2009
IEEE
188views Robotics» more  ICRA 2009»
16 years 1 months ago
Potential field guide for humanoid multicontacts acyclic motion planning
Abstract—We present a motion planning algorithm that computes rough trajectories used by a contact-points planner as a guide to grow its search graph. We adapt collision-free mot...
Karim Bouyarmane, Adrien Escande, Florent Lamiraux...
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
16 years 1 months ago
Distributed motion constraints for algebraic connectivity of robotic networks
— This paper studies connectivity maintenance of robotic networks that communicate at discrete times and move in continuous space. We propose a distributed algorithm that allows ...
Michael Schuresko, Jorge Cortés
FSTTCS
2007
Springer
16 years 26 days ago
Undirected Graphs of Entanglement 2
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale
LICS
2006
IEEE
16 years 22 days ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
DAC
2006
ACM
16 years 21 days ago
DyXY: a proximity congestion-aware deadlock-free dynamic routing method for network on chip
A novel routing algorithm, namely dynamic XY (DyXY) routing, is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time. ...
Ming Li, Qing-An Zeng, Wen-Ben Jone