1727 search results - page 58 / 346 » A Technique for Large Automated Mechanism Design Problems |
178
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
152
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy can be traded off with runtime, arise naturally in many optimization contexts....
166
click to vote
DAC
2000
ACM
16 years 7 months ago
2000
ACM
The proliferation of the Internet has a ected the business model of almost all semiconductor and VLSI CAD companies that rely on intellectual property (IP) as their main source of...
168
click to vote
VLSID
2008
IEEE
16 years 6 months ago
2008
IEEE
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
164
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...