Sciweavers

2713 search results - page 92 / 543
» Parameterized Tree Systems
Sort
View
103
Voted
ENTCS
2006
117views more  ENTCS 2006»
15 years 25 days ago
Distributed Graph Traversals by Relabelling Systems with Applications
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...
Bilel Derbel, Mohamed Mosbah
99
Voted
ANLP
2000
115views more  ANLP 2000»
15 years 2 months ago
Categorizing Unknown Words: Using Decision Trees to Identify Names and Misspellings
This paper introduces a system for categorizing unknown words. The system is based on a multicomponent architecture where each component is responsible for identifying one class o...
Janine Toole
108
Voted
CSR
2009
Springer
15 years 4 months ago
The Reachability Problem over Infinite Graphs
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
Wolfgang Thomas
88
Voted
ENTCS
2007
121views more  ENTCS 2007»
15 years 23 days ago
An Account of Implementing Applicative Term Rewriting
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...
Muck van Weerdenburg
AUTOMATICA
2010
129views more  AUTOMATICA 2010»
15 years 28 days ago
Stability analysis for multi-agent systems using the incidence matrix: Quantized communication and formation control
The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multiagent control problems. In particular, we consider the pr...
Dimos V. Dimarogonas, Karl Henrik Johansson