5169 search results - page 393 / 1034 » Locality approximation using time |
169
click to vote
JCO
1998
15 years 6 months ago
1998
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...
162
click to vote
IPPS
2005
IEEE
16 years 13 days ago
2005
IEEE
The problem of scheduling independent tasks on heterogeneous trees is considered. The nodes of the tree may have different processing times, and links different communication time...
173
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
Model compensation is a standard way of improving the robustness of speech recognition systems to noise. A number of popular schemes are based on vector Taylor series (vts) compen...
183
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
168
click to vote
PSIVT
2009
Springer
15 years 11 months ago
2009
Springer
This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the a...