Sciweavers

2084 search results - page 370 / 417
» Set Constraints in Logic Programming
Sort
View
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 8 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...
BMCBI
2006
107views more  BMCBI 2006»
13 years 8 months ago
Analysis of optimal phenotypic space using elementary modes as applied to Corynebacterium glutamicum
Background: Quantification of the metabolic network of an organism offers insights into possible ways of developing mutant strain for better productivity of an extracellular metab...
Kalyan Gayen, K. V. Venkatesh
CP
2007
Springer
14 years 2 months ago
Tradeoffs in the Complexity of Backdoor Detection
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
PASTE
2005
ACM
14 years 1 months ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen
TASE
2008
IEEE
13 years 7 months ago
New Hybrid Optimization Algorithms for Machine Scheduling Problems
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
Yunpeng Pan, Leyuan Shi