Sciweavers

1380 search results - page 194 / 276
» Computing the optimal strategy to commit to
Sort
View
PDPTA
2003
13 years 9 months ago
HPJava: Programming Support for High-Performance Grid-Enabled Applications
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...
Han-Ku Lee, Bryan Carpenter, Geoffrey Fox, Sang Bo...
ICASSP
2011
IEEE
12 years 12 months ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 2 months ago
The Complexity of Solving Stochastic Games on Graphs
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...
Daniel Andersson, Peter Bro Miltersen
MOBIHOC
2004
ACM
14 years 1 months ago
On the behavior of communication links of a node in a multi-hop mobile environment
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...
Prince Samar, Stephen B. Wicker
FOCS
1994
IEEE
14 years 8 days ago
The Load, Capacity and Availability of Quorum Systems
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...
Moni Naor, Avishai Wool