Sciweavers

1074 search results - page 149 / 215
» Parallelizing post-placement timing optimization
Sort
View
ICS
2010
Tsinghua U.
14 years 5 months ago
Are Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
Yonatan Bilu, Nathan Linial
EUROGP
2007
Springer
175views Optimization» more  EUROGP 2007»
14 years 1 months ago
Fast Genetic Programming on GPUs
As is typical in evolutionary algorithms, fitness evaluation in GP takes the majority of the computational effort. In this paper we demonstrate the use of the Graphics Processing...
Simon Harding, Wolfgang Banzhaf
FCCM
2005
IEEE
106views VLSI» more  FCCM 2005»
14 years 1 months ago
High-Performance FPGA-Based General Reduction Methods
FPGA-based floating-point kernels must exploit algorithmic parallelism and use deeply pipelined cores to gain a performance advantage over general-purpose processors. Inability t...
Gerald R. Morris, Ling Zhuo, Viktor K. Prasanna
CIKM
2009
Springer
14 years 2 months ago
Packing the most onto your cloud
Parallel dataflow programming frameworks such as Map-Reduce are increasingly being used for large scale data analysis on computing clouds. It is therefore becoming important to a...
Ashraf Aboulnaga, Ziyu Wang, Zi Ye Zhang
ICPPW
2002
IEEE
14 years 20 days ago
Quantitative Analysis of Transmission Power Control in Wireless Ad-hoc Networks
Abstract—In this paper, we address the issue of transmission power control in wireless ad-hoc networks. In general, it is assumed that minimum transmission power achieves the opt...
Seung-Jong Park, Raghupathy Sivakumar