3016 search results - page 57 / 604 » The Online Transportation Problem |
118
Voted
APPML
2007
15 years 3 months ago
2007
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
136
Voted
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Online boosting is one of the most successful online learning algorithms in computer vision. While many challenging online learning problems are inherently multi-class, online boo...
127
Voted
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
117
Voted
DISOPT
2008
15 years 3 months ago
2008
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
114
Voted
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...