703 search results - page 75 / 141 » Maintenance scheduling problems as benchmarks for constraint... |
84
Voted
AIPS
2007
15 years 19 hour ago
2007
Autonomous systems operating in real-world environments must be able to plan, schedule, and execute missions while robustly adapting to uncertainty and disturbances. Previous work...
SPAA
2010
ACM
14 years 10 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
65
Voted
CODES
1999
IEEE
15 years 2 months ago
1999
IEEE
In this paper, we propose a fast and simple heuristic for the cosynthesis problem targeting the system-on-chip (SOC) design. The proposed algorithm covers from implementation sele...
89
Voted
RTSS
1992
IEEE
15 years 1 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
114
click to vote
SPAA
1999
ACM
15 years 2 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...