Sciweavers

1364 search results - page 176 / 273
» Collective Optimization
Sort
View
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 4 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
CLUSTER
2008
IEEE
14 years 4 months ago
A trace-driven emulation framework to predict scalability of large clusters in presence of OS Jitter
—Various studies have pointed out the debilitating effects of OS Jitter on the performance of parallel applications on large clusters such as the ASCI Purple and the Mare Nostrum...
Pradipta De, Ravi Kothari, Vijay Mann
ICCS
2005
Springer
14 years 3 months ago
The Dynamics of Computing Agent Systems
The paper presents the Multi Agent System (MAS) designed for the large scale parallel computations. The special kind of diffusionbased scheduling enables to decompose and allocate...
Maciej Smolka, Piotr Uhruski, Robert Schaefer, Mar...
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 3 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
RTCSA
2003
IEEE
14 years 3 months ago
An Approximation Algorithm for Broadcast Scheduling in Heterogeneous Clusters
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
Pangfeng Liu, Da-Wei Wang, Yi-Heng Guo