Sciweavers

225 search results - page 37 / 45
» The Design and Optimization of SOC Test Solutions
Sort
View
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
15 years 5 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 3 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria
AAAI
2007
15 years 2 months ago
Acquiring Visibly Intelligent Behavior with Example-Guided Neuroevolution
Much of artificial intelligence research is focused on devising optimal solutions for challenging and well-defined but highly constrained problems. However, as we begin creating...
Bobby D. Bryant, Risto Miikkulainen
DAM
2008
111views more  DAM 2008»
14 years 11 months ago
Sums of squares based approximation algorithms for MAX-SAT
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
Hans van Maaren, Linda van Norden, M. J. H. Heule
JCO
1998
136views more  JCO 1998»
14 years 11 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...