Sciweavers

2698 search results - page 189 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
242
Voted
ESANN
2000
15 years 8 months ago
A neural network approach to adaptive pattern analysis - the deformable feature map
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
Axel Wismüller, Frank Vietze, Dominik R. Ders...
180
Voted
AAAI
2007
15 years 9 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
159
Voted
PKDD
2005
Springer
109views Data Mining» more  PKDD 2005»
16 years 16 days ago
An Imbalanced Data Rule Learner
Imbalanced data learning has recently begun to receive much attention from research and industrial communities as traditional machine learners no longer give satisfactory results. ...
Canh Hao Nguyen, Tu Bao Ho
SODA
2010
ACM
172views Algorithms» more  SODA 2010»
16 years 4 months ago
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
Aparna Das, Claire Mathieu
189
Voted
FSTTCS
2003
Springer
16 years 7 days ago
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. The...
Nikhil R. Devanur, Vijay V. Vazirani