1165 search results - page 147 / 233 » Effective linear programming based placement methods |
136
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Hybrid algorithms that combine genetic algorithms with the Nelder-Mead simplex algorithm have been effective in solving certain optimization problems. In this article, we apply a s...
161
click to vote
JMLR
2010
14 years 9 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
128
click to vote
VLSISP
2008
15 years 2 months ago
2008
Each new semiconductor technology node brings smaller, faster transistors and smaller, slower wires. In particular, long interconnect wires in modern FPGAs now require rebuffering ...
135
click to vote
SAS
2009
Springer
16 years 3 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
148
click to vote
JAVA
1999
Springer
15 years 7 months ago
1999
Springer
The Java language incurs a runtime overhead for exception checks and object accesses without an interior pointer in order to ensure safety. It also requires type inclusion test, d...