Sciweavers

642 search results - page 65 / 129
» Approximation Algorithms for Minimum K-Cut
Sort
View
EOR
2002
105views more  EOR 2002»
14 years 11 months ago
Two-dimensional packing problems: A survey
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
Andrea Lodi, Silvano Martello, Michele Monaci
CORR
2011
Springer
146views Education» more  CORR 2011»
14 years 6 months ago
An Implicit Cover Problem in Wild Population Study
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...
Mary V. Ashley, Tanya Y. Berger-Wolf, Wanpracha Ar...
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 6 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
TWC
2010
14 years 6 months ago
Reduced-Complexity Joint Baseband Compensation of Phase Noise and I/Q Imbalance for MIMO-OFDM Systems
The maximum likelihood estimate of the impulse response of a frequency-selective channel in the presence of phase noise and I/Q imbalance is derived. The complexity of the joint es...
Rabie Rabiei, Won Namgoong, Naofal Al-Dhahir
GECCO
2006
Springer
154views Optimization» more  GECCO 2006»
15 years 3 months ago
Spectral techniques for graph bisection in genetic algorithms
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
Jacob G. Martin