Sciweavers

4488 search results - page 34 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
CADE
2011
Springer
14 years 2 months ago
Cutting to the Chase Solving Linear Integer Arithmetic
Abstract. We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut...
Dejan Jovanovic, Leonardo Mendonça de Moura
CPAIOR
2007
Springer
15 years 8 months ago
A Position-Based Propagator for the Open-Shop Problem
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
Jean-Noël Monette, Yves Deville, Pierre Dupon...
186
Voted
WAPCV
2007
Springer
15 years 8 months ago
Context Driven Focus of Attention for Object Detection
Abstract. Context plays an important role in general scene perception. In particular, it can provide cues about an object’s location within an image. In computer vision, object d...
Roland Perko, Ales Leonardis
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 3 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
ICDIM
2007
IEEE
15 years 8 months ago
A novel Variable Neighborhood Particle Swarm Optimization for multi-objective Flexible Job-Shop Scheduling Problems
This paper introduces a hybrid metaheuristic, the Variable Neighborhood Particle Swarm Optimization (VNPSO), consisting of a combination of the Variable Neighborhood Search (VNS) ...
Hongbo Liu, Ajith Abraham, Crina Grosan