Sciweavers

UAI
2001
14 years 6 months ago
Maximum Likelihood Bounded Tree-Width Markov Networks
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...
Nathan Srebro
ISPD
1997
ACM
74views Hardware» more  ISPD 1997»
14 years 9 months ago
A matrix synthesis approach to thermal placement
— 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...
Chris C. N. Chu, D. F. Wong
GLVLSI
1998
IEEE
129views VLSI» more  GLVLSI 1998»
14 years 9 months ago
Tabu Search Based Circuit Optimization
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...
Sadiq M. Sait, Habib Youssef, Munir M. Zahra
IPPS
1999
IEEE
14 years 9 months ago
Mapping Media Streams onto a Network of Servers
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...
Reinhard Lüling
HPDC
2000
IEEE
14 years 9 months ago
An Enabling Framework for Master-Worker Applications on the Computational Grid
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 ...
Jean-Pierre Goux, Sanjeev Kulkarni, Jeff Linderoth...
EMO
2001
Springer
100views Optimization» more  EMO 2001»
14 years 9 months ago
Fuzzy Evolutionary Hybrid Metaheuristic for Network Topology Design
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...
Habib Youssef, Sadiq M. Sait, Salman A. Khan
EVOW
2009
Springer
14 years 9 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
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...
David Rodríguez Rueda, Carlos Cotta, Antoni...
CPAIOR
2010
Springer
14 years 9 months ago
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
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...
Timo Berthold, Stefan Heinz, Marco E. Lübbeck...
EVOW
2004
Springer
14 years 10 months ago
Scatter Search and Memetic Approaches to the Error Correcting Code Problem
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...
Carlos Cotta
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
14 years 10 months ago
A stochastic programming approach to scheduling in TAC SCM
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...
Michael Benisch, Amy R. Greenwald, Victor Narodits...