Sciweavers

15485 search results - page 401 / 3097
» Computing Optimal Subsets
Sort
View
IRREGULAR
1995
Springer
15 years 10 months ago
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
16 years 9 days ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener
IEEEAMS
2003
IEEE
16 years 2 days ago
The Almaden OptimalGrid Project
In this paper, we present a description of The Almaden OptimalGrid Project, which is selfconfiguring, and optimizing grid middleware that makes it easy to harness the computationa...
Glenn Deen, Tobin J. Lehman, James H. Kaufman
COMPUTING
2004
88views more  COMPUTING 2004»
15 years 6 months ago
Spline Curve Approximation and Design by Optimal Control Over the Knots
In [1] Optimal Control methods over re-parametrization for curve and surface design were introduced. The advantage of Optimal Control over Global Minimization such as in [17] is t...
Rony Goldenthal, Michel Bercovier
ICCV
2011
IEEE
14 years 6 months ago
Optimal Estimation of Vanishing Points in a Manhattan World
In this paper, we present an analytical method for computing the globally optimal estimates of orthogonal vanishing points in a “Manhattan world” with a calibrated camera. We ...
Faraz Mirzaei, Stergios Roumeliotis