Sciweavers

9888 search results - page 1604 / 1978
» Active Algorithm Selection
Sort
View
MP
2002
176views more  MP 2002»
15 years 6 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell
TON
2002
117views more  TON 2002»
15 years 6 months ago
Generalized loop-back recovery in optical mesh networks
Current means of providing loop-back recovery, which is widely used in SONET, rely on ring topologies, or on overlaying logical ring topologies upon physical meshes. Loop-back is d...
Muriel Médard, Richard A. Barry, Steven G. ...
PR
2007
100views more  PR 2007»
15 years 6 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
PVLDB
2008
124views more  PVLDB 2008»
15 years 6 months ago
Google's Deep Web crawl
The Deep Web, i.e., content hidden behind HTML forms, has long been acknowledged as a significant gap in search engine coverage. Since it represents a large portion of the structu...
Jayant Madhavan, David Ko, Lucja Kot, Vignesh Gana...
LCTRTS
2010
Springer
15 years 4 months ago
Improving both the performance benefits and speed of optimization phase sequence searches
The issues of compiler optimization phase ordering and selection present important challenges to compiler developers in several domains, and in particular to the speed, code size,...
Prasad A. Kulkarni, Michael R. Jantz, David B. Wha...
« Prev « First page 1604 / 1978 Last » Next »