Sciweavers

885 search results - page 111 / 177
» Optimal Polygon Placement
Sort
View
FCCM
1998
IEEE
113views VLSI» more  FCCM 1998»
14 years 2 months ago
PAM-Blox: High Performance FPGA Design for Adaptive Computing
PAM-Blox are object-oriented circuit generators on top of the PCI Pamette design environment, PamDC. High- performance FPGA design for adaptive computing is simplified by using a ...
Oskar Mencer, Martin Morf, Michael J. Flynn
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
14 years 1 months ago
A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
Steven Manos, Geraint Lewis
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
14 years 1 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
LISA
2001
13 years 11 months ago
Macroscopic Internet Topology and Performance Measurements from the DNS Root Name Servers
We describe active measurements of topology and end-to-end latency characteristics between several of the DNS root servers and a subset of their clients using the skitter tool dev...
Marina Fomenkov, Kimberly C. Claffy, Bradley Huffa...
ICCAD
2005
IEEE
83views Hardware» more  ICCAD 2005»
14 years 7 months ago
Post-placement rewiring and rebuffering by exhaustive search for functional symmetries
Separate optimizations of logic and layout have been thoroughly studied in the past and are well documented for common benchmarks. However, to be competitive, modern circuit optim...
Kai-Hui Chang, Igor L. Markov, Valeria Bertacco