1102 search results - page 111 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
DATE
2004
IEEE
14 years 20 days ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
AI
2000
Springer
13 years 8 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
HPDC
2010
IEEE
13 years 10 months ago
2010
IEEE
The recent emergence of clouds is making the vision of utility computing realizable, i.e. computing resources and services can be delivered, utilized, and paid for as utilities su...
ATAL
2006
Springer
14 years 20 days ago
2006
Springer
This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bdi logic. ...