Sciweavers

12257 search results - page 246 / 2452
» Analysis of Algorithms
Sort
View
SAC
2006
ACM
15 years 8 months ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
SLS
2007
Springer
111views Algorithms» more  SLS 2007»
15 years 8 months ago
Mixed Models for the Analysis of Local Search Components
We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...
Jørgen Bang-Jensen, Marco Chiarandini, Yuri...
ICML
2007
IEEE
16 years 2 months ago
Exponentiated gradient algorithms for log-linear structured prediction
Conditional log-linear models are a commonly used method for structured prediction. Efficient learning of parameters in these models is therefore an important problem. This paper ...
Amir Globerson, Terry Koo, Xavier Carreras, Michae...
ISCAS
2002
IEEE
121views Hardware» more  ISCAS 2002»
15 years 6 months ago
Analog filter adaptation using a dithered linear search algorithm
A variation of the differential steepest descent algorithm, here called the dithered linear search (DLS), is examined and applied to analog filter adaptation. The DLS algorithm is...
Anthony Chan Carusone, David A. Johns
COMPGEOM
2008
ACM
15 years 3 months ago
Self-improving algorithms for delaunay triangulations
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
Kenneth L. Clarkson, C. Seshadhri