Sciweavers

295 search results - page 41 / 59
» A New Node Centroid Algorithm for Bandwidth Minimization
Sort
View
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
14 years 7 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
120
Voted
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
15 years 4 days ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
AAAI
2010
14 years 11 months ago
Single-Frontier Bidirectional Search
On the surface, bidirectional search (BDS) is an attractive idea with the potential for significant asymptotic reductions in search effort. However, the results in practice often ...
Ariel Felner, Carsten Moldenhauer, Nathan R. Sturt...
HPCA
2012
IEEE
13 years 5 months ago
Balancing DRAM locality and parallelism in shared memory CMP systems
Modern memory systems rely on spatial locality to provide high bandwidth while minimizing memory device power and cost. The trend of increasing the number of cores that share memo...
Min Kyu Jeong, Doe Hyun Yoon, Dam Sunwoo, Mike Sul...
SAMOS
2004
Springer
15 years 3 months ago
High-Speed Event-Driven RTL Compiled Simulation
In this paper we present a new approach for generating high-speed optimized event-driven register transfer level (RTL) compiled simulators. The generation of the simulators is part...
Alexey Kupriyanov, Frank Hannig, Jürgen Teich