10 search results - page 2 / 2 » Graph Operations Characterizing Rank-Width and Balanced Grap... |
LOGCOM
1998
13 years 4 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
FQAS
2000
Springer
13 years 9 months ago
2000
Springer
Knowledge scouts are software agents that autonomously synthesize knowledge of interest to a given user (target knowledge) by applying inductive database operators to a local or di...
STACS
1994
Springer
13 years 9 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
CCGRID
2010
IEEE
13 years 2 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
IANDC
2006
13 years 5 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...