314 search results - page 22 / 63 » Complete Problems for Dynamic Complexity Classes |
178
click to vote
ISCA
2003
IEEE
15 years 11 months ago
2003
IEEE
Meeting deadlines is a key requirement in safe realtime systems. Worst-case execution times (WCET) of tasks are needed for safe planning. Contemporary worst-case timing analysis t...
119
click to vote
WIA
2005
Springer
15 years 11 months ago
2005
Springer
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...
166
click to vote
ATAL
2009
Springer
16 years 14 days ago
2009
Springer
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
165
click to vote
DNA
2006
Springer
15 years 9 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
215
click to vote
ACRI
2004
Springer
15 years 11 months ago
2004
Springer
Cellular automata (CA) are highly parallel and discrete dynamical systems, whose behavior is completely specified in terms of a local relation. They were successfully applied for s...