Sciweavers

3192 search results - page 12 / 639
» The minimum latency problem
Sort
View
NOCS
2008
IEEE
15 years 4 months ago
Network Simplicity for Latency Insensitive Cores
In this paper we examine a latency insensitive network composed of very fast and simple circuits that connects SoC cores that are also latency insensitive, de-synchronized, or asy...
Daniel Gebhardt, JunBok You, W. Scott Lee, Kenneth...
WADS
2005
Springer
162views Algorithms» more  WADS 2005»
15 years 3 months ago
The Minimum-Area Spanning Tree Problem
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
LATIN
1995
Springer
15 years 1 months ago
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
David Fernández-Baca, Giora Slutzki
ICS
2005
Tsinghua U.
15 years 3 months ago
Reducing latencies of pipelined cache accesses through set prediction
With the increasing performance gap between the processor and the memory, the importance of caches is increasing for high performance processors. However, with reducing feature si...
Aneesh Aggarwal
TON
2010
221views more  TON 2010»
14 years 4 months ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang