1102 search results - page 111 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
125
click to vote
DATE
2004
IEEE
15 years 4 months 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...
110
Voted
INFOCOM
2007
IEEE
15 years 7 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
15 years 15 days 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...
107
Voted
HPDC
2010
IEEE
15 years 1 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...
98
Voted
ATAL
2006
Springer
15 years 4 months 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. ...