731 search results - page 103 / 147 » Reductions to Graph Isomorphism |
FSTTCS
2008
Springer
13 years 10 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
DM
2006
13 years 8 months ago
2006
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
JSC
2007
13 years 8 months ago
2007
Geometric constructions applied to a rational action of an algebraic group lead to a new algorithm for computing rational invariants. A finite generating set of invariants appear...
COMCOM
1998
13 years 8 months ago
1998
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserve...
DLOG
2011
13 years 10 days ago
2011
The canonical standard description logic reasoning service is classification, that is, the generation of the set of atomic subsumptions which are entailed by some ontology. While ...