Sciweavers

1090 search results - page 29 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
IAJIT
2008
223views more  IAJIT 2008»
13 years 8 months ago
A New Exam Scheduling Algorithm Using Graph Coloring
: This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Throug...
Mohammad Malkawi, Mohammad Al-Haj Hassan, Osama Al...
RTCSA
2003
IEEE
14 years 2 months ago
Scheduling Jobs with Multiple Feasible Intervals
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When...
Chi-Sheng Shih, Jane W.-S. Liu, Infan Kuok Cheong
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
13 years 10 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
14 years 2 months ago
Hybrid real-coded mutation for genetic algorithms applied to graph layouts
In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem...
Dana Vrajitoru, Jason DeBoni
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
13 years 6 months ago
Parallel shared memory strategies for ant-based optimization algorithms
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Riz...