Sciweavers

8671 search results - page 43 / 1735
» A generator for hierarchical problems
Sort
View
AAAI
2000
13 years 10 months ago
Generating Satisfiable Problem Instances
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
Dimitris Achlioptas, Carla P. Gomes, Henry A. Kaut...
ECCV
2008
Springer
14 years 11 months ago
Automatic Generator of Minimal Problem Solvers
Abstract. Finding solutions to minimal problems for estimating epipolar geometry and camera motion leads to solving systems of algebraic equations. Often, these systems are not tri...
Martin Bujnak, Tomás Pajdla, Zuzana Kukelov...
DNA
2004
Springer
14 years 2 months ago
Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
Ji Youn Lee, Hee-Woong Lim, Suk-In Yoo, Byoung-Tak...
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
14 years 2 months ago
Generalized benchmark generation for dynamic combinatorial problems
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
Abdulnasser Younes, Paul H. Calamai, Otman A. Basi...
EOR
2007
90views more  EOR 2007»
13 years 9 months ago
Accelerating column generation for variable sized bin-packing problems
In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...
Cláudio Alves, José M. Valéri...