1380 search results - page 194 / 276 » Computing the optimal strategy to commit to |
123
Voted
PDPTA
2003
15 years 4 months ago
2003
The paper begins by considering what a Grid Computing Environment might be, why it is demanded, and how the authors’ HPspmd programming fits into this picture. We then review o...
141
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
138
click to vote
ISAAC
2009
Springer
15 years 10 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...
146
click to vote
MOBIHOC
2004
ACM
15 years 8 months ago
2004
ACM
In this work, we develop an analytical framework to investigate the behavior of the communication links of a node in a random mobility environment. Analytical expressions characte...
142
click to vote
FOCS
1994
IEEE
15 years 7 months ago
1994
IEEE
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...