Sciweavers

94 search results - page 19 / 19
» Time-Deterministic Hybrid Transition Systems
Sort
View
ICRA
2003
IEEE
144views Robotics» more  ICRA 2003»
13 years 10 months ago
Error-tolerant execution of complex robot tasks based on skill primitives
— This paper presents a general approach to specify and execute complex robot tasks considering uncertain environments. Robot tasks are defined by a precise definition of socal...
Ulrike Thomas, Bernd Finkemeyer, Torsten Krög...
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
13 years 10 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
ASPDAC
2007
ACM
121views Hardware» more  ASPDAC 2007»
13 years 8 months ago
Ultralow-Power Reconfigurable Computing with Complementary Nano-Electromechanical Carbon Nanotube Switches
In recent years, several alternative devices have been proposed to deal with inherent limitation of conventional CMOS devices in terms of scalability at nanometer scale geometry. ...
Swarup Bhunia, Massood Tabib-Azar, Daniel G. Saab
LMCS
2007
132views more  LMCS 2007»
13 years 4 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla