Sciweavers

2354 search results - page 84 / 471
» A Common-Sense Theory of Time
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Decidability and Complexity Results for Timed Automata via Channel Machines
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
Parosh Aziz Abdulla, Johann Deneux, Joël Ouak...
UAI
2003
13 years 9 months ago
Learning Continuous Time Bayesian Networks
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
Uri Nodelman, Christian R. Shelton, Daphne Koller
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 8 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
RTSS
2008
IEEE
14 years 2 months ago
Schedulability and Compatibility of Real Time Asynchronous Objects
Abstract—We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The beh...
Mohammad Mahdi Jaghoori, Delphine Longuet, Frank S...
ICC
2007
IEEE
149views Communications» more  ICC 2007»
14 years 2 months ago
Synchronization Signal Design for OFDM Based On Time-Frequency Hopping Patterns
— In an OFDM system, channel estimation can be considered as sampling the time-frequency response of the channel through a number of known pilot symbols placed across the time-fr...
Jiann-Ching Guey