Sciweavers

900 search results - page 75 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
LICS
2009
IEEE
14 years 3 months ago
Statistic Analysis for Probabilistic Processes
—We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence p...
Michel de Rougemont, Mathieu Tracol
LICS
2009
IEEE
14 years 3 months ago
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
Oliver Friedmann
FUIN
2007
133views more  FUIN 2007»
13 years 8 months ago
Intercode Regular Languages
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
Yo-Sub Han, Kai Salomaa, Derick Wood
CDC
2010
IEEE
13 years 3 months ago
On the marginal instability of linear switched systems
Stability properties for continuous-time linear switched systems are at first determined by the (largest) Lyapunov exponent associated with the system, which is the analogous of t...
Yacine Chitour, Paolo Mason, Mario Sigalotti
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 7 months ago
Structural Solutions to Dynamic Scheduling for Multimedia Transmission in Unknown Wireless Environments
In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate th...
Fangwen Fu, Mihaela van der Schaar