Sciweavers

85 search results - page 13 / 17
» Improved Algorithms for Uniform Partitions of Points
Sort
View
IPPS
1997
IEEE
15 years 3 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
SIGARCH
2008
97views more  SIGARCH 2008»
14 years 11 months ago
SP-NUCA: a cost effective dynamic non-uniform cache architecture
1 This paper presents a simple but effective method to reduce on-chip access latency and improve core isolation in CMP Non-Uniform Cache Architectures (NUCA). The paper introduces ...
Javier Merino, Valentin Puente, Pablo Prieto, Jos&...
ATAL
2010
Springer
15 years 25 days ago
A distributed algorithm for anytime coalition structure generation
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system...
Tomasz P. Michalak, Jacek Sroka, Talal Rahwan, Mic...
ICALP
2009
Springer
15 years 12 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
ICALP
2001
Springer
15 years 4 months ago
A Framework for Index Bulk Loading and Dynamization
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...
Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, ...