986 search results - page 124 / 198 » Parallel Computation in Abstract Network Machine |
127
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
139
click to vote
COORDINATION
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Service oriented applications feature interactions among several participants over the network. Mechanisms such as correlation sets and two-party sessions have been propo...
160
Voted
PPSN
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
139
click to vote
ICDCS
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— In this paper, we explore multi-hop bandwidth estimation assuming arbitrary cross-traffic at each node and develop a new probing method called Envelope that can asympt...
120
click to vote
EUROPAR
2008
Springer
15 years 6 months ago
2008
Springer
Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one mponent-based approaches provide an abstraction su...