Sciweavers

4110 search results - page 477 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
ANOR
2008
93views more  ANOR 2008»
15 years 6 months ago
Pruning in column generation for service vehicle dispatching
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...
Stephan Westphal, Sven Oliver Krumke
ANOR
2008
75views more  ANOR 2008»
15 years 6 months ago
Geometric decay in level-expanding QBD models
Level-expanding quasi-birth-and-death (QBD) processes have been shown to be an efficient modeling tool for studying multi-dimensional systems, especially twodimensional ones. Comp...
Liming Liu, Masakiyo Miyazawa, Yiqiang Q. Zhao
CC
2008
Springer
131views System Software» more  CC 2008»
15 years 6 months ago
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
Marius Zimand
CORR
2010
Springer
73views Education» more  CORR 2010»
15 years 6 months ago
On the Impact of the Migration Topology on the Island Model
Parallel Global Optimization Algorithms (PGOA) provide an efficient way of dealing with hard optimization problems. One method of parallelization of GOAs that is frequently applie...
Marek Rucinski, Dario Izzo, Francesco Biscani
160
Voted
CORR
2008
Springer
133views Education» more  CORR 2008»
15 years 6 months ago
Estimating divergence functionals and the likelihood ratio by convex risk minimization
We develop and analyze M-estimation methods for divergence functionals and the likelihood ratios of two probability distributions. Our method is based on a non-asymptotic variatio...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...