779 search results - page 77 / 156 » Algorithms for the Sample Mean of Graphs |
147
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
130
click to vote
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
109
click to vote
SIGMETRICS
2004
ACM
15 years 10 months ago
2004
ACM
Balancing peer-to-peer graphs, including zone-size distributions, has recently become an important topic of peer-topeer (P2P) research [1], [2], [6], [19], [31], [36]. To bring an...
152
Voted
PDP
2003
IEEE
15 years 9 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
134
click to vote
DAC
1995
ACM
15 years 8 months ago
1995
ACM
- We introduce a transformation, named rephasing, that manipulates the timing parameters in control-dataflow graphs. Traditionally high-level synthesis systems for DSP have either ...