501 search results - page 44 / 101 » Scheduling Abstractions for Local Search |
88
Voted
FLAIRS
2003
15 years 2 months ago
2003
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
118
click to vote
EOR
2007
15 years 23 days ago
2007
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
104
Voted
SARA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
80
Voted
CAD
1998
Springer
15 years 16 days ago
1998
Springer
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
109
click to vote
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...