Sciweavers

547 search results - page 29 / 110
» Preference-Based Search for Scheduling
Sort
View
95
Voted
RTSS
2008
IEEE
15 years 5 months ago
Priority Assignment for Real-Time Wormhole Communication in On-Chip Networks
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
Zheng Shi, Alan Burns
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
14 years 11 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
TRANSCI
2008
108views more  TRANSCI 2008»
14 years 11 months ago
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search
The availability of relatively cheap small jet aircrafts suggests a new air transportation business: dial-a-flight, an on-demand service in which travelers call a few days in adva...
Daniel G. Espinoza, R. Garcia, Marcos Goycoolea, G...
PATAT
2000
Springer
124views Education» more  PATAT 2000»
15 years 2 months ago
Tabu Search Techniques for Examination Timetabling
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...
Luca Di Gaspero, Andrea Schaerf
FLAIRS
2006
15 years 13 days ago
Tabu Search for a Car Sequencing Problem
The goal of this paper is to propose a tabu search heuristic for the car sequencing problem (CSP) used for the ROADEF 2005 international Challenge. This NP-hard problem was propos...
Nicolas Zufferey, Martin Studer, Edward A. Silver