Sciweavers

ISNN
2009
Springer
14 years 6 months ago
An Improved Quantum Evolutionary Algorithm with 2-Crossovers
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
Zhihui Xing, Haibin Duan, Chunfang Xu
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
14 years 6 months ago
Crossover operators for multiobjective k-subset selection
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
Thorsten Meinl, Michael R. Berthold
COCOA
2009
Springer
14 years 6 months ago
Matching Techniques Ride to Rescue OLED Displays
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
Andreas Karrenbauer
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
14 years 9 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor
ICALP
2009
Springer
14 years 11 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
STOC
2002
ACM
141views Algorithms» more  STOC 2002»
14 years 11 months ago
Combinatorial optimization problems in self-assembly
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 11 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
ICML
2007
IEEE
15 years 9 days ago
Transductive support vector machines for structured variables
We study the problem of learning kernel machines transductively for structured output variables. Transductive learning can be reduced to combinatorial optimization problems over a...
Alexander Zien, Ulf Brefeld, Tobias Scheffer
ECCV
2006
Springer
15 years 1 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady