516 search results - page 32 / 104 » Generalizing the Discrete Timed Automaton |
COMPGEOM
1998
ACM
14 years 2 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
QEST
2010
IEEE
13 years 7 months ago
2010
IEEE
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
GLOBECOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— This paper presents an analytical model for the analysis of Hybrid ARQ techniques on Discrete Time Markov Channels by means of Markov chains. The first contribution is an orig...