2210 search results - page 206 / 442 » CLEF 2001 - Overview of Results |
159
click to vote
FSTTCS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. This paper addresses the state explosion problem in automata based LTL model checking. To deal with large space requirements we turn to use a distributed approach. All th...
186
click to vote
FSTTCS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
185
click to vote
FSTTCS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
204
click to vote
FSTTCS
2001
Springer
15 years 10 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
156
click to vote
FUZZY
2001
Springer
15 years 10 months ago
2001
Springer
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...