Sciweavers

442 search results - page 15 / 89
» Discovering Heuristic Strategy for Solving Scheduling Proble...
Sort
View
CCCG
1996
15 years 3 months ago
Heuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...
109
Voted
ISCAPDCS
2007
15 years 3 months ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel
SLS
2009
Springer
224views Algorithms» more  SLS 2009»
15 years 8 months ago
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
Thierry Benoist, Bertrand Estellon, Fréd&ea...
126
Voted
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
15 years 8 months ago
Two adaptive mutation operators for optima tracking in dynamic optimization problems with evolution strategies
The dynamic optimization problem concerns finding an optimum in a changing environment. In the tracking problem, the optimizer should be able to follow the optimum’s changes ov...
Claudio Rossi, Antonio Barrientos, Jaime del Cerro
PRICAI
2004
Springer
15 years 7 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...