Sciweavers

1177 search results - page 31 / 236
» System-in-Package Testing: Problems and Solutions
Sort
View
CVPR
2009
IEEE
16 years 4 months ago
Projective Least-Squares: Global Solutions with Local Optimization
Recent work in multiple view geometry has focused on obtaining globally optimal solutions at the price of computational time efciency. On the other hand, traditional bundle adj...
Carl Olsson, Fredrik Kahl, Richard I. Hartley
GECCO
2006
Springer
163views Optimization» more  GECCO 2006»
15 years 1 months ago
The quadratic multiple knapsack problem and three heuristic approaches to it
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
Amanda Hiley, Bryant A. Julstrom
98
Voted
EC
2008
146views ECommerce» more  EC 2008»
14 years 9 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
PPSN
1998
Springer
15 years 1 months ago
Genetic Algorithms for the Multiple Container Packing Problem
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...
Günther R. Raidl, Gabriele Kodydek
JCO
1998
136views more  JCO 1998»
14 years 9 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...