Sciweavers

381 search results - page 17 / 77
» Fraction-Free RNS Algorithms for Solving Linear Systems
Sort
View
ICASSP
2011
IEEE
13 years 21 days ago
Basis Pursuit in sensor networks
Basis Pursuit (BP) finds a minimum ℓ1-norm vector z that satisfies the underdetermined linear system Mz = b, where the matrix M and vector b are given. Lately, BP has attracte...
João F. C. Mota, João M. F. Xavier, ...
RANDOM
2001
Springer
14 years 1 months ago
Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
Susanne Albers, Carsten Witt
SIAMJO
2000
74views more  SIAMJO 2000»
13 years 8 months ago
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
Jordi Castro
MANSCI
2007
139views more  MANSCI 2007»
13 years 8 months ago
A Market-Based Optimization Algorithm for Distributed Systems
In this paper, a market-based decomposition method for decomposable linear systems is developed. The solution process iterates between a master problem that solves the market-matc...
Zhiling Guo, Gary J. Koehler, Andrew B. Whinston
STTT
2011
195views more  STTT 2011»
13 years 3 months ago
Parallel probabilistic model checking on general purpose graphics processors
We present algorithms for parallel probabilistic model checking on general purpose graphic processing units (GPGPUs). Our improvements target the numerical components of the tradit...
Dragan Bosnacki, Stefan Edelkamp, Damian Sulewski,...