11328 search results - page 4 / 2266 » Timed Branching Processes |
104
click to vote
BIRTHDAY
2000
Springer
15 years 6 months ago
2000
Springer
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...
108
click to vote
EMNLP
2010
14 years 11 months ago
2010
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...
170
Voted
IJCAI
1989
15 years 2 months ago
1989
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
143
Voted
STACS
2012
Springer
13 years 9 months ago
2012
Springer
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a...
121
click to vote
DDECS
2006
IEEE
15 years 7 months ago
2006
IEEE
Abstract: Bisimulations in general are a powerful concept to minimize large finite state systems regarding some well-defined observational behavior. In contrast to strong bisimul...