Sciweavers

332 search results - page 46 / 67
» A Direct Algorithm for Multi-valued Bounded Model Checking
Sort
View
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...
ICRA
2008
IEEE
197views Robotics» more  ICRA 2008»
14 years 1 months ago
A Bayesian framework for optimal motion planning with uncertainty
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
Andrea Censi, Daniele Calisi, Alessandro De Luca, ...
STOC
1991
ACM
93views Algorithms» more  STOC 1991»
13 years 11 months ago
Rounds in Communication Complexity Revisited
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
Noam Nisan, Avi Wigderson
COMCOM
2004
84views more  COMCOM 2004»
13 years 7 months ago
A self-extracting accurate modeling for bounded-delay video services
This article proposes the XGOP-B deterministic traffic model for MPEG video services requiring strict bounds on the quality of service provided by the network. The XGOP-B model ta...
Marcelo Dias de Amorim, Otto Carlos Muniz Bandeira...
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
13 years 9 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn