3206 search results - page 106 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
100
Voted
COCOA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
116
Voted
EUC
2006
Springer
15 years 6 months ago
2006
Springer
As the ever-increasing gap between the speed of processor and the speed of memory has become the cause of one of primary bottlenecks of computer systems, modern architecture system...
104
Voted
GCC
2003
Springer
15 years 8 months ago
2003
Springer
Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we pres...
118
Voted
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
We develop an approach to intrinsic dimension estimation based on k-nearest neighbor (kNN) distances. The dimension estimator is derived using a general theory on functionals of k...
126
Voted
LION
2009
Springer
15 years 9 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...