874 search results - page 141 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
AAAI
2010
14 years 11 months ago
2010
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
COCOA
2009
Springer
15 years 4 months ago
2009
Springer
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
CPAIOR
2007
Springer
15 years 4 months ago
2007
Springer
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
102
click to vote
JSA
2007
14 years 9 months ago
2007
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...