2566 search results - page 15 / 514 » The Online Median Problem |
JCSS
2007
14 years 11 months ago
2007
IJCV
1998
14 years 11 months ago
1998
This paper formulates the optic flow problem as a set of over-determined simultaneous linear equations. It then introduces and studies two new robust optic flow methods. The fir...
SWAT
1994
Springer
15 years 3 months ago
1994
Springer
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
TCS
2008
14 years 11 months ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...