Sciweavers

1182 search results - page 57 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
EOR
2007
70views more  EOR 2007»
15 years 1 months ago
Solving the maximum edge weight clique problem via unconstrained quadratic programming
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
Bahram Alidaee, Fred Glover, Gary A. Kochenberger,...
ANOR
2005
72views more  ANOR 2005»
15 years 1 months ago
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee,...
ICASSP
2009
IEEE
15 years 8 months ago
Joint MIMO radar waveform and receiving filter optimization
Abstract—The concept of MIMO (multiple-input multipleoutput) radar allows each transmitting antenna element to transmit an arbitrary waveform. This provides extra degrees of free...
Chun-Yang Chen, P. P. Vaidyanathan
ICCV
2007
IEEE
16 years 3 months ago
LogCut - Efficient Graph Cut Optimization for Markov Random Fields
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
Victor S. Lempitsky, Carsten Rother, Andrew Blake
SAC
2002
ACM
15 years 1 months ago
On optimal temporal locality of stencil codes
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...
Claudia Leopold