Sciweavers

1177 search results - page 33 / 236
» System-in-Package Testing: Problems and Solutions
Sort
View
PRICAI
1998
Springer
15 years 1 months ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
14 years 10 months ago
A parallel evolutionary algorithm for unconstrained binary quadratic problems
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
István Borgulya
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 1 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
JCST
2008
134views more  JCST 2008»
14 years 9 months ago
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
Xiaomin Hu, Jun Zhang, Yun Li
EOR
2007
158views more  EOR 2007»
14 years 9 months ago
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
Edmund K. Burke, Barry McCollum, Amnon Meisels, Sa...