Sciweavers

1719 search results - page 41 / 344
» Scheduling with soft constraints
Sort
View
RTSS
1994
IEEE
14 years 2 months ago
Efficient Aperiodic Service Under Earliest Deadline Scheduling
In this paper we present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic lash is scheduled using the Earliest ...
Marco Spuri, Giorgio C. Buttazzo
PPAM
2005
Springer
14 years 3 months ago
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...
Krzysztof Giaro, Marek Kubale
AAAI
2004
13 years 11 months ago
An Effective Algorithm for Project Scheduling with Arbitrary Temporal Constraints
The resource-constrained project scheduling problem with time windows (RCPSP/max) is an important generalization of a number of well studied scheduling problems. In this paper, we...
Tristan B. Smith, John M. Pyle
FLAIRS
2008
14 years 6 days ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
CIRA
2007
IEEE
136views Robotics» more  CIRA 2007»
14 years 4 months ago
Algebraic interval constraint driven exploration in human-agent collaborative problem solving
—To enable effective human-agent collaboration, new human-centric computing paradigms are needed. This paper presents a soft constraint representation scheme based on generalized...
Yan Wang