Sciweavers

3221 search results - page 558 / 645
» Termination of Linear Programs
Sort
View
GRID
2006
Springer
15 years 6 months ago
Workflow Global Computing with YML
In this paper we propose a framework dedicated to the development and the execution of parallel applications over large scale global computing platforms. A workflow programming env...
Olivier Delannoy, Nahid Emad, Serge G. Petiton
IEICET
2006
114views more  IEICET 2006»
15 years 6 months ago
Synchronization Verification in System-Level Design with ILP Solvers
Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making de...
Thanyapat Sakunkonchak, Satoshi Komatsu, Masahiro ...
CN
2007
154views more  CN 2007»
15 years 6 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 6 months ago
Searching for low weight pseudo-codewords
— Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach...
Michael Chertkov, Mikhail G. Stepanov
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 6 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright