Sciweavers

1169 search results - page 18 / 234
» Degrees of monotone complexity
Sort
View
HYBRID
2010
Springer
14 years 2 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan
RSA
2008
85views more  RSA 2008»
13 years 7 months ago
Quasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
Fan Chung Graham, Ronald L. Graham
ISVLSI
2005
IEEE
115views VLSI» more  ISVLSI 2005»
14 years 1 months ago
Quasi-Exact BDD Minimization Using Relaxed Best-First Search
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
Rüdiger Ebendt, Rolf Drechsler
PODC
2009
ACM
14 years 2 months ago
Brief announcement: new bounds for the controller problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic distributed tool that an abstraction for managing the consumption of a global resource i...
Yuval Emek, Amos Korman
ETFA
2006
IEEE
14 years 1 months ago
Response-Time Analysis of tasks with offsets
Abstract— This article presents some results about schedulability analysis of tasks with offsets also known as transactions, in the particular case of monotonic transactions. The...
Karim Traore, Emmanuel Grolleau, Ahmed Rahni, Mich...