314 search results - page 49 / 63 » Complete Problems for Dynamic Complexity Classes |
SIGMETRICS
1998
ACM
13 years 11 months ago
1998
ACM
We consider the problem of scheduling tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among no...
FCS
2007
13 years 8 months ago
2007
In many task-planning domains, dynamic assemblies of autonomous agents are replacing hierarchical organisations because they promise more agility. In such assemblies, interdepende...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the node...
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
CASES
2003
ACM
14 years 20 days ago
2003
ACM
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...