20126 search results - page 178 / 4026 » Timed Transition Systems |
144
Voted
DAC
1994
ACM
15 years 7 months ago
1994
ACM
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
137
Voted
NIPS
1998
15 years 5 months ago
1998
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
145
Voted
AAAI
2008
15 years 6 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
130
Voted
ACSD
2003
IEEE
15 years 9 months ago
2003
IEEE
Message Sequence Charts (MSC) have been traditionally used to depict execution scenarios in the early stages of design cycle. MSCs portray inter-process ( inter-object) interactio...
116
click to vote
ACTA
2007
15 years 3 months ago
2007
Abstract This paper introduces the notion of well-structured language. A wellstructured language can be defined by a labelled well-structured transition system, equipped with an u...