Sciweavers

1989 search results - page 77 / 398
» cost 2010
Sort
View
AAAI
2010
15 years 1 months ago
Sequential Incremental-Value Auctions
We study the distributed allocation of tasks to cooperating robots in real time, where each task has to be assigned to exactly one robot so that the sum of the latencies of all ta...
Xiaoming Zheng, Sven Koenig
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 1 days ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae
ICPR
2010
IEEE
15 years 1 days ago
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
Luisa Micó, José Oncina
ICANN
2010
Springer
15 years 21 hour ago
Deep Bottleneck Classifiers in Supervised Dimension Reduction
Deep autoencoder networks have successfully been applied in unsupervised dimension reduction. The autoencoder has a "bottleneck" middle layer of only a few hidden units, ...
Elina Parviainen
CORR
2010
Springer
104views Education» more  CORR 2010»
14 years 12 months ago
Approximating the minimum directed tree cover
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
Viet Hung Nguyen