Sciweavers

1224 search results - page 26 / 245
» Theory decision by decomposition
Sort
View
DM
2010
85views more  DM 2010»
15 years 6 months ago
Hamiltonian decompositions of complete k-uniform hypergraphs
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We ...
Robert F. Bailey, Brett Stevens
ICRA
2005
IEEE
166views Robotics» more  ICRA 2005»
16 years 8 days ago
Bilateral Teleoperation of Multiple Cooperative Robots over Delayed Communication Networks: Theory
Abstract— We propose a control framework for the bilateral teleoperation between a single master robot and multiple cooperative slave robots with communication-delay in the maste...
Dongjun Lee, Mark W. Spong
CORR
2006
Springer
151views Education» more  CORR 2006»
15 years 6 months ago
Combining decision procedures for the reals
Abstract. We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consi...
Jeremy Avigad, Harvey Friedman
ICASSP
2008
IEEE
16 years 1 months ago
Hybrid design of filtered-x adaptive algorithm via sampled-data control theory
Analysis and design of ltered-x adaptive algorithms are conventionally done by assuming that the transfer function in the secondary path is a discrete-time system. However, in rea...
Masaaki Nagahara, Yutaka Yamamoto
ICRA
2010
IEEE
133views Robotics» more  ICRA 2010»
15 years 5 months ago
Variable resolution decomposition for robotic navigation under a POMDP framework
— Partially Observable Markov Decision Processes (POMDPs) offer a powerful mathematical framework for making optimal action choices in noisy and/or uncertain environments, in par...
Robert Kaplow, Amin Atrash, Joelle Pineau