UAI
2001
14 years 5 months ago
2001
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
ISPD
1997
ACM
14 years 8 months ago
1997
ACM
— In this paper, we consider the thermal placement problem for gate arrays. We introduce a new combinatorial optimization problem, matrix synthesis problem (MSP), to model the th...
GLVLSI
1998
IEEE
14 years 8 months ago
1998
IEEE
In this paper we address the problem of optimizing mixed CMOS BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an ta...
IPPS
1999
IEEE
14 years 8 months ago
1999
IEEE
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...
HPDC
2000
IEEE
14 years 8 months ago
2000
IEEE
We describe MW – a software framework that allows users to quickly and easily parallelize scientific computations using the master-worker paradigm on the computationalgrid. MW ...
EMO
2001
Springer
14 years 9 months ago
2001
Springer
Abstract. Topology design of enterprise networks is a hard combinatorial optimization problem. It has numerous constraints, several objectives, and a very noisy solution space. Bes...
EVOW
2009
Springer
14 years 9 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
CPAIOR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
EVOW
2004
Springer
14 years 9 months ago
2004
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackl...
SIGECOM
2004
ACM
14 years 10 months ago
2004
ACM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...