Sciweavers

10901 search results - page 190 / 2181
» Approximations in Distributed Optimization
Sort
View
CVPR
2010
IEEE
16 years 2 months ago
Fast Approximate Energy Minimization with Label Costs
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
Andrew Delong, Anton Osokin, Hossam Isack, Yuri Bo...
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
16 years 1 days ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 6 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
MP
2002
84views more  MP 2002»
15 years 6 months ago
A decomposition procedure based on approximate Newton directions
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
Antonio J. Conejo, Francisco J. Nogales, Francisco...
WSC
2004
15 years 7 months ago
Optimal Computing Budget Allocation Under Correlated Sampling
We consider the optimal computing budget allocation (OCBA) problem where the simulated designs are correlated. The exact optimal allocation is presented for two designs, and an ap...
Michael C. Fu, Jian-Qiang Hu, Chun-Hung Chen, Xiao...