Sciweavers

2080 search results - page 203 / 416
» Measuring empirical computational complexity
Sort
View
COR
2011
15 years 1 days ago
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abel Garcia-Najera, John A. Bullinaria
PODC
2009
ACM
15 years 12 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
CVPR
2003
IEEE
16 years 7 months ago
Evaluation of Local Models of Dynamic Backgrounds
Background subtraction is the first step of many video surveillance applications. What is considered background varies by application, and may include regular, systematic, or comp...
Robert Pless, John Larson, Scott Siebers, Ben West...
153
Voted
ICPR
2006
IEEE
16 years 6 months ago
Boosted Band Ratio Feature Selection for Hyperspectral Image Classification
Band ratios have many useful applications in hyperspectral image analysis. While optimal ratios have been chosen empirically in previous research, we propose a principled algorith...
Antonio Robles-Kelly, Nianjun Liu, Terry Caelli, Z...
ICML
2009
IEEE
16 years 5 months ago
Efficient Euclidean projections in linear time
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
Jun Liu, Jieping Ye