Sciweavers

114 search results - page 19 / 23
» Interactive Proof Systems with Polynomially Bounded Strategi...
Sort
View
LPAR
2004
Springer
14 years 1 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
HCI
2009
13 years 5 months ago
Statistics-Based Cognitive Human-Robot Interfaces for Board Games - Let's Play!
Abstract. The archetype of many novel research activities is called cognition. Although separate definitions exist to define a technical cognitive system, it is typically character...
Frank Wallhoff, Alexander Bannat, Jürgen Gast...
IANDC
2007
107views more  IANDC 2007»
13 years 7 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
ICAC
2007
IEEE
14 years 2 months ago
Autonomic Reactive Systems via Online Learning
— Reactive systems are those that maintain an ongoing interaction with their environment at a speed dictated by the latter. Examples of such systems include web servers, network ...
Sanjit A. Seshia
CAV
2009
Springer
206views Hardware» more  CAV 2009»
14 years 8 months ago
D-Finder: A Tool for Compositional Deadlock Detection and Verification
D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction. For deadlock detecti...
Saddek Bensalem, Marius Bozga, Thanh-Hung Nguyen, ...