Sciweavers

8540 search results - page 217 / 1708
» The Dynamic Servers Problem
Sort
View
JVA
2006
IEEE
15 years 9 months ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
CP
2005
Springer
15 years 8 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
AUSAI
2004
Springer
15 years 8 months ago
A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
Songshan Guo, Ying Kong, Andrew Lim, Fan Wang
ICTAI
2003
IEEE
15 years 8 months ago
A Diversity-Controlling Adaptive Genetic Algorithm for the Vehicle Routing Problem with Time Windows
This paper presents an adaptive genetic algorithm (GA) to solve the Vehicle Routing Problem with Time Windows (VRPTW) to near optimal solutions. The algorithm employs a unique dec...
Kenny Qili Zhu
IPPS
1997
IEEE
15 years 7 months ago
A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
Smaïl Niar, Arnaud Fréville