1032 search results - page 130 / 207 » Extended Computation Tree Logic |
COMPGEOM
1990
ACM
15 years 1 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
For a general class of infinite data structures including streams, binary trees, and the combination of finite and infinite lists, we investigate a notion of productivity. This ...
USENIX
2008
15 years 5 days ago
2008
This paper explores the challenges associated with distributed application management in large-scale computing environments. In particular, we investigate several techniques for e...
JPDC
2008
14 years 9 months ago
2008
By splitting a large broadcast message into segments and broadcasting the segments in a pipelined fashion, pipelined broadcast can achieve high performance in many systems. In thi...
TCS
2010
14 years 4 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...