Sciweavers

306 search results - page 30 / 62
» Parallel approximation algorithms for facility-location prob...
Sort
View
168
Voted
ICPADS
1994
IEEE
15 years 7 months ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
ICS
1989
Tsinghua U.
15 years 7 months ago
Convergence rate and termination of asynchronous iterative algorithms
We consider iterative algorithms of the form z := f(z), executed by a parallel or distributed computing system. We focus on asynchronous implementations whereby each processor ite...
Dimitri P. Bertsekas, John N. Tsitsiklis
129
Voted
SDM
2010
SIAM
200views Data Mining» more  SDM 2010»
15 years 5 months ago
Residual Bayesian Co-clustering for Matrix Approximation
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
Hanhuai Shan, Arindam Banerjee
122
Voted
FSTTCS
2007
Springer
15 years 10 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit
132
Voted
ATAL
2004
Springer
15 years 9 months ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...