1355 search results - page 100 / 271 » Alternating Timed Automata over Bounded Time |
IDEAS
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
CIAC
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
ATAL
2004
Springer
14 years 2 months ago
2004
Springer
Most BDI agent architectures rely on plan libraries in order to ensure bounded time for means-ends reasoning. Nevertheless, the usage of fast planning algorithms to provide the ag...
WCET
2010
13 years 6 months ago
2010
To take full advantage of the increasingly used shared-memory multicore architectures, software algorithms will need to be parallelized over multiple threads. This means that thre...
WEA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...