Sciweavers

380 search results - page 26 / 76
» Projective Least-Squares: Global Solutions with Local Optimi...
Sort
View
EOR
2010
116views more  EOR 2010»
14 years 10 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
MP
2007
102views more  MP 2007»
14 years 9 months ago
Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
The elastic-mode formulation of the problem of minimizing a nonlinear function subject to equilibrium constraints has appealing local properties in that, for a finite value of the...
Mihai Anitescu, Paul Tseng, Stephen J. Wright
ICCAD
2007
IEEE
281views Hardware» more  ICCAD 2007»
15 years 6 months ago
Archer: a history-driven global routing algorithm
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
Muhammet Mustafa Ozdal, Martin D. F. Wong
IICAI
2003
14 years 11 months ago
A Hybrid Genetic Algorithm for Minimum Vertex Cover Problem
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
Ketan Kotecha, Nilesh Gambhava
PAMI
2006
156views more  PAMI 2006»
14 years 9 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann