Sciweavers

840 search results - page 143 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
EOR
2008
106views more  EOR 2008»
13 years 11 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
FTML
2008
185views more  FTML 2008»
13 years 11 months ago
Graphical Models, Exponential Families, and Variational Inference
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...
Martin J. Wainwright, Michael I. Jordan
DAM
2006
83views more  DAM 2006»
13 years 11 months ago
Scheduling workover rigs for onshore oil production
Many oil wells in Brazilian onshore fields rely on artificial lift methods. Maintenance services such as cleaning, reinstatement, stimulation and others are essential to these wel...
Dario J. Aloise, Daniel Aloise, Caroline T. M. Roc...
JSAT
2010
132views more  JSAT 2010»
13 years 5 months ago
The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
Federico Heras, David Bañeres
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
14 years 5 months ago
SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks
Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereb...
Peter Boyen, Frank Neven, Dries Van Dyck, Aalt-Jan...