2850 search results - page 455 / 570 » On Timed Models and Full Abstraction |
118
click to vote
DLT
2006
15 years 2 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
112
click to vote
FLAIRS
2004
15 years 2 months ago
2004
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...
99
Voted
ERSA
2003
15 years 2 months ago
2003
Abstract— Reconfigurable computing architectures aim to dynamically adapt their hardware to the application at hand. As research shows, the time it takes to reconfigure the har...
101
Voted
CORR
2010
Springer
15 years 26 days ago
2010
Springer
Abstract--We study the design of media streaming applications in the presence of multiple heterogeneous wireless access methods with different throughputs and costs. Our objective ...
109
Voted
CORR
2007
Springer
15 years 23 days ago
2007
Springer
Discrete temporal transitions occur in a variety of domains, but this work is mainly motivated by applications in molecular biology: explaining and analyzing observed transcriptome...