Sciweavers

1001 search results - page 150 / 201
» Testing Formal Dialectic
Sort
View
ICRA
2007
IEEE
189views Robotics» more  ICRA 2007»
14 years 3 months ago
Context Estimation and Learning Control through Latent Variable Extraction: From discrete to continuous contexts
— Recent advances in machine learning and adaptive motor control have enabled efficient techniques for online learning of stationary plant dynamics and it’s use for robust pre...
Georgios Petkos, Sethu Vijayakumar
IROS
2007
IEEE
138views Robotics» more  IROS 2007»
14 years 3 months ago
Tracking control for snake robot joints
— This paper considers the problem of model based control of the joints of a snake robot without wheels. The potential range of applications for snake robots are numerous, and de...
Aksel Andreas Transeth, Nathan van de Wouw, Alexey...
TPHOL
2007
IEEE
14 years 3 months ago
Formalising Java's Data Race Free Guarantee
We formalise the data race free (DRF) guarantee provided by Java, as captured by the semi-formal Java Memory Model (JMM) [1] and published in the Java Language Specification [2]. ...
David Aspinall, Jaroslav Sevcík
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
14 years 3 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...
CAV
2007
Springer
116views Hardware» more  CAV 2007»
14 years 3 months ago
A Decision Procedure for Bit-Vectors and Arrays
Abstract. STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has been optimized for large problems encoun...
Vijay Ganesh, David L. Dill