Sciweavers

547 search results - page 24 / 110
» Preference-Based Search for Scheduling
Sort
View
GI
2007
Springer
15 years 5 months ago
On Sensor Scheduling in Case of Unreliable Communication
: This paper deals with the linear discrete-time sensor scheduling problem in unreliable communication networks. In case of the common assumption of an errorfree communication, the...
Marco F. Huber, Eric Stiegeler, Uwe D. Hanebeck
100
Voted
AAAI
2007
15 years 1 months ago
Optimal Multi-Agent Scheduling with Constraint Programming
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
Willem Jan van Hoeve, Carla P. Gomes, Bart Selman,...
OPODIS
2007
15 years 14 days ago
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
Theodore P. Baker, Michele Cirinei
AIPS
2006
15 years 13 days ago
Resource Contention Metrics for Oversubscribed Scheduling Problems
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
Laurence A. Kramer, Stephen F. Smith
FGCS
2006
82views more  FGCS 2006»
14 years 11 months ago
PGGA: A predictable and grouped genetic algorithm for job scheduling
This paper presents a predictable and grouped genetic algorithm (PGGA) for job scheduling. The novelty of the PGGA is twofold: (1) a job workload estimati...
Maozhen Li, Bin Yu, Man Qi