Sciweavers

618 search results - page 102 / 124
» Short cycle connectivity
Sort
View
XPU
2005
Springer
14 years 26 days ago
Agile Methods for Embedded Systems
The main goal to be answered by this Ph.D. thesis is whether there is a potential for a successful and powerful application of agile methods and related techniques to embedded syst...
Dirk Wilking
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 26 days ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
ICPP
2003
IEEE
14 years 20 days ago
A Hardware-based Cache Pollution Filtering Mechanism for Aggressive Prefetches
Aggressive hardware-based and software-based prefetch algorithms for hiding memory access latencies were proposed to bridge the gap of the expanding speed disparity between proces...
Xiaotong Zhuang, Hsien-Hsin S. Lee
ICALP
2010
Springer
14 years 6 days ago
Additive Spanners in Nearly Quadratic Time
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
David P. Woodruff
ISCA
1996
IEEE
126views Hardware» more  ISCA 1996»
13 years 11 months ago
Memory Bandwidth Limitations of Future Microprocessors
This paper makes the case that pin bandwidth will be a critical consideration for future microprocessors. We show that many of the techniques used to tolerate growing memory laten...
Doug Burger, James R. Goodman, Alain Kägi