1144 search results - page 46 / 229 » Fractal Algorithm for Finding Global Optimal Solution |
APIN
2002
14 years 9 months ago
2002
This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results ...
ICTAI
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...
ISPD
2003
ACM
15 years 3 months ago
2003
ACM
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
LCTRTS
2004
Springer
15 years 3 months ago
2004
Springer
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
ISPD
1997
ACM
15 years 1 months ago
1997
ACM
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...