3838 search results - page 380 / 768 » Techniques for Optimization of Net Algorithms |
188
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
The main goal of this paper is to develop deeper insights into viable placement-level optimization of routing. Two primary contributions are made. First, an experimental framework...
194
Voted
UAI
2001
15 years 8 months ago
2001
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
170
click to vote
SAC
2005
ACM
16 years 11 days ago
2005
ACM
This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of ro...
157
click to vote
LCPC
2001
Springer
15 years 11 months ago
2001
Springer
Information gathered by the existing pointer analysis techniques can be classified as must aliases or definitely-points-to relationships, which hold for all executions, and may a...
162
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...