20 search results - page 3 / 4 » Abstraction and Constraint Satisfaction Techniques for Plann... |
NOMS
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—We study the problem of dynamic resource allocation to clustered Web applications. We extend application server middleware with the ability to automatically decide the s...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
CSCLP
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
CPAIOR
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
Abstract. Embedded multimedia systems often run multiple time-constrained applications simultaneously. These systems use multiprocessor systems-on-chip of which it must be guarante...