Sciweavers

276 search results - page 33 / 56
» The Complexity of Computing Maximal Word Functions
Sort
View
AUTOMATICA
2008
134views more  AUTOMATICA 2008»
13 years 7 months ago
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
AIL
2006
84views more  AIL 2006»
13 years 7 months ago
Meaningful electronic signatures based on an automatic indexing method
Legal information certification and secured storage combined with documents electronic signature are of great interest when digital documents security and conservation are in conce...
Maxime Wack, Ahmed Nait-Sidi-Moh, Sid Lamrous, Nat...
INFORMATICALT
2007
127views more  INFORMATICALT 2007»
13 years 7 months ago
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loo
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
Vytautas Cyras
NCA
2010
IEEE
13 years 2 months ago
Anatomy-based organization of morphology and control in self-reconfigurable modular robots
In this paper we address the challenge of realizing full-body behaviors in scalable modular robots. We present an experimental study of a biologically inspired approach to organize...
David Johan Christensen, Jason Campbell, Kasper St...
IEEESCC
2005
IEEE
14 years 1 months ago
Discovering Semantic Relations between Web Services Using Their Pre and Post-Conditions
Discovering and assembling individual Web services into more complex yet new and more useful Web processes has received significant attention from academia recently. In this thesi...
Lin Lin, Ismailcem Budak Arpinar