Sciweavers

3433 search results - page 289 / 687
» Heuristics for a bidding problem
Sort
View
STACS
2004
Springer
16 years 3 days ago
Optimal and Online Preemptive Scheduling on Uniformly Related Machines
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
Tomás Ebenlendr, Jiri Sgall
CAEPIA
2003
Springer
15 years 12 months ago
An Interactive Train Scheduling Tool for Solving and Plotting Running Maps
We present a tool for solving and plotting train schedules which has been developed in collaboration with the National Network of Spanish Railways (RENFE). This tool transforms rai...
Federico Barber, Miguel A. Salido, Laura Paola Ing...
184
Voted
SSIAI
2002
IEEE
15 years 11 months ago
Two Dimensional Projective Point Matching
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
Jason Denton, J. Ross Beveridge
193
Voted
EVOW
2001
Springer
15 years 11 months ago
An Evolutionary Annealing Approach to Graph Coloring
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
Dimitris Fotakis, Spiridon D. Likothanassis, Stama...
CODES
1998
IEEE
15 years 11 months ago
A path analysis based partitioning for time constrained embedded systems
The HW/SW partitioning problem addressed in this paper is one of the key steps in the co-design flow of heterogeneous embedded systems. Generally the aim is to provide solutions t...
Luc Bianco, Michel Auguin, Guy Gogniat, Alain Pega...