Sciweavers

14739 search results - page 160 / 2948
» An optimization problem on the sphere
Sort
View
IJCAI
2001
15 years 5 hour ago
Backbones in Optimization and Approximation
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...
John K. Slaney, Toby Walsh
SIAMDM
2010
117views more  SIAMDM 2010»
14 years 9 months ago
Design is as Easy as Optimization
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vaz...
EC
2008
153views ECommerce» more  EC 2008»
14 years 10 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
CORR
2008
Springer
126views Education» more  CORR 2008»
14 years 10 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
CDC
2010
IEEE
176views Control Systems» more  CDC 2010»
14 years 5 months ago
Random projection algorithms for convex set intersection problems
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
Angelia Nedic