Sciweavers

2778 search results - page 138 / 556
» Limit complexities revisited
Sort
View
ICRA
2008
IEEE
119views Robotics» more  ICRA 2008»
16 years 25 days ago
Distributed, dynamic, and autonomous reconfiguration planning for chain-type self-reconfigurable robots
— This paper presents a dynamic and distributed reconfiguration planning algorithm for chain-type selfreconfigurable robots, by which a robot can autonomously self-reconfigure fr...
Feili Hou, Wei-Min Shen
ETS
2007
IEEE
105views Hardware» more  ETS 2007»
16 years 22 days ago
Communication-Centric SoC Debug Using Transactions
— The growth in System-on-Chip complexity puts pressure on system verification. Due to limitations in the pre-silicon verification process, errors in hardware and software slip...
Bart Vermeulen, Kees Goossens, Remco van Steeden, ...
BPM
2007
Springer
265views Business» more  BPM 2007»
16 years 18 days ago
BPM on Top of SOA: Experiences from the Financial Industry
Abstract. Service Oriented Architecture (SOA) forms an ideal infrastructure for Business Process Management as applications are invoked using standard interfaces and protocols. Aut...
Steen Brahe
ICRA
2006
IEEE
118views Robotics» more  ICRA 2006»
16 years 13 days ago
Symbolic Control for Underactuated Differentially Flat Systems
— In this paper we address the problem of generating input plans to steer complex dynamical systems in an obstaclefree environment. Plans considered admit a finite description l...
Adriano Fagiolini, Luca Greco, Antonio Bicchi, Ben...
QEST
2006
IEEE
16 years 12 days ago
Bound-Preserving Composition for Markov Reward Models
Stochastic orders can be applied to Markov reward models and used to aggregate models, while introducing a bounded error. Aggregation reduces the number of states in a model, miti...
David Daly, Peter Buchholz, William H. Sanders