Sciweavers

1833 search results - page 5 / 367
» A Matrix-Based Approach to the Global Locality Optimization ...
Sort
View
DPD
1998
117views more  DPD 1998»
13 years 5 months ago
Solving Local Cost Estimation Problem for Global Query Optimization in Multidatabase Systems
To meet users’ growing needs for accessing pre-existing heterogeneous databases, a multidatabase system (MDBS) integrating multiple databases has attracted many researchers recen...
Qiang Zhu, Per-Åke Larson
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
13 years 11 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
OL
2007
121views more  OL 2007»
13 years 5 months ago
Global optimization by continuous grasp
We introduce a novel global optimization method called Continuous GRASP (C-GRASP) which extends Feo and Resende’s greedy randomized adaptive search procedure (GRASP) from the dom...
Michael J. Hirsch, Cláudio Nogueira de Mene...
3DIM
2005
IEEE
13 years 11 months ago
Fitting of 3D Circles and Ellipses Using a Parameter Decomposition Approach
Many optimization processes encounter a problem in efficiently reaching a global minimum or a near global minimum. Traditional methods such as Levenberg-Marquardt algorithm and t...
Xiaoyi Jiang, Da-Chuan Cheng
JMLR
2010
143views more  JMLR 2010»
13 years 4 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...