1355 search results - page 41 / 271 » Alternating Timed Automata over Bounded Time |
AIPS
2009
13 years 8 months ago
2009
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
QEST
2008
IEEE
14 years 2 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
LATA
2009
Springer
14 years 6 days ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
CPM
2001
Springer
14 years 4 days ago
2001
Springer
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
TWC
2008
13 years 7 months ago
2008
Abstract-- This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets success...