2632 search results - page 127 / 527 » Alternating Timed Automata |
130
click to vote
JALC
2007
15 years 3 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
155
Voted
ISSRE
2010
IEEE
15 years 1 months ago
2010
IEEE
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
134
Voted
QEST
2010
IEEE
15 years 1 months ago
2010
IEEE
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
149
Voted
RTSS
2008
IEEE
15 years 9 months ago
2008
IEEE
The Real-Time Calculus (RTC) framework proposed in [Chakraborty et al., DATE 2003] and subsequently extended in [Wandeler et al., Real-Time Systems 29(2-3), 2005] and a number of ...
140
click to vote
ANSS
2000
IEEE
15 years 7 months ago
2000
IEEE
We present, in this paper, an algorithm which integrates flow control and dynamic load balancing in Time Warp. The algorithm is intended for use in a distributed memory environme...