Sciweavers

4526 search results - page 32 / 906
» Algorithmic problems related to the Internet
Sort
View
SCALESPACE
2005
Springer
14 years 2 months ago
Relations Between Higher Order TV Regularization and Support Vector Regression
We study the connection between higher order total variation (TV) regularization and support vector regression (SVR) with spline kernels in a one-dimensional discrete setting. We p...
Gabriele Steidl, Stephan Didas, Julia Neumann
AUSAI
1999
Springer
14 years 28 days ago
Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
Edmund K. Burke, Graham Kendall
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
14 years 1 months ago
ERA: An Algorithm for Reducing the Epistasis of SAT Problems
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
COCOON
2007
Springer
14 years 2 months ago
Priority Algorithms for the Subset-Sum Problem
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
Yuli Ye, Allan Borodin
MOC
2000
85views more  MOC 2000»
13 years 8 months ago
Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory and the neighbourhood techniques, Hotta and Yoshise proposed a noninterior point algorithm f...
Liqun Qi, Defeng Sun