Sciweavers

10051 search results - page 1879 / 2011
» A Dynamic Separator Algorithm
Sort
View
157
Voted
DAC
1998
ACM
15 years 6 months ago
Synthesis of Power-Optimized and Area-Optimized Circuits from Hierarchical Behavioral Descriptions
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...
Ganesh Lakshminarayana, Niraj K. Jha
SIGCOMM
1996
ACM
15 years 6 months ago
Improving the Start-Up Behavior of a Congestion Control Scheme for TCP
Based on experiments conducted in a network simulator and over real networks, this paper proposes changes to the congestion control scheme in current TCP implementations to improv...
Janey C. Hoe
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 6 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
158
Voted
ICS
1993
Tsinghua U.
15 years 6 months ago
Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...
131
Voted
PLDI
1994
ACM
15 years 6 months ago
Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses
As microprocessor speeds increase, memory bandwidth is increasing y the performance bottleneck for microprocessors. This has occurred because innovation and technological improvem...
Jack W. Davidson, Sanjay Jinturkar
« Prev « First page 1879 / 2011 Last » Next »