Sciweavers

93 search results - page 15 / 19
» Weak Alternating Timed Automata
Sort
View
LATA
2009
Springer
14 years 2 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle
JSS
2006
112views more  JSS 2006»
13 years 7 months ago
Generalized comparison of graph-based ranking algorithms for publications and authors
Citation analysis helps in evaluating the impact of scientific collections (journals and conferences), publications and scholar authors. In this paper we examine known algorithms ...
Antonis Sidiropoulos, Yannis Manolopoulos
EOR
2007
93views more  EOR 2007»
13 years 7 months ago
An integrated approach for deriving priorities in analytic network process
A multiple objective programming approach for the analytic network process (ANP) is proposed to obtain all local priorities for crisp or interval judgments at one time, even in an...
Jing-Rung Yu, Sheu-Ji Cheng
ARCS
2008
Springer
13 years 9 months ago
How Efficient are Creatures with Time-shuffled Behaviors?
: The task of the creatures in the "creatures' exploration problem" is to visit all empty cells in an environment with a minimum number of steps. We have analyzed th...
Patrick Ediger, Rolf Hoffmann, Mathias Halbach
STRINGOLOGY
2008
13 years 9 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter