591 search results - page 94 / 119 » A constraint programming approach to cutset problems |
MOR
2002
13 years 8 months ago
2002
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
EDOC
2007
IEEE
14 years 13 days ago
2007
IEEE
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
PLDI
2004
ACM
14 years 1 months ago
2004
ACM
In this paper we present Jedd, a language extension to Java that supports a convenient way of programming with Binary Decision Diagrams (BDDs). The Jedd language abstracts BDDs as...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
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...
TPDS
2008
13 years 8 months ago
2008
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...