7648 search results - page 140 / 1530 » A Data Locality Optimizing Algorithm |
111
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We propose in this paper an exploratory analysis algorithm for functional data. The method partitions a set of functions into K clusters and represents each cluster by a simple pr...
223
click to vote
WASA
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. Due to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper foc...
109
Voted
CRV
2009
IEEE
15 years 9 months ago
2009
IEEE
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
121
click to vote
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
114
click to vote
UIST
2006
ACM
15 years 8 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...