Sciweavers

595 search results - page 101 / 119
» A Constraint Programming Approach for Solving a Queueing Con...
Sort
View
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 7 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
TPDS
2008
175views more  TPDS 2008»
13 years 7 months ago
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
Olivier Beaumont, Larry Carter, Jeanne Ferrante, A...
SIAMIS
2011
13 years 2 months ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...
CCR
2000
96views more  CCR 2000»
13 years 7 months ago
Decentralized optimal traffic engineering in the internet
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...
Constantino M. Lagoa, Hao Che
ICML
2007
IEEE
14 years 8 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner