252 search results - page 16 / 51 » Task Assignment and Scheduling under Memory Constraints |
122
Voted
AAAI
1994
15 years 1 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
90
Voted
ISORC
2006
IEEE
15 years 5 months ago
2006
IEEE
Convenience, reliability, and effectiveness of automatic memory management have long been established in modern systems and programming languages such as Java. The timeliness req...
CP
2003
Springer
15 years 4 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
93
Voted
RTCSA
1995
IEEE
15 years 3 months ago
1995
IEEE
In this paper, we present a joint scheduling of hard deadline periodic and soft deadline aperiodic tasks in dynamic-priority systems. The proposed algorithm has extended the fixed...
115
Voted
RTAS
2003
IEEE
15 years 5 months ago
2003
IEEE
A reward-based task typically consists of a mandatory part that must be accomplished before the given deadline, and an optional part that is associated with rewards for partial co...