Sciweavers

16430 search results - page 84 / 3286
» On Computable Tree Functions
Sort
View
CSL
2010
Springer
15 years 4 months ago
Graded Computation Tree Logic with Binary Coding
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
Alessandro Bianco, Fabio Mogavero, Aniello Murano
93
Voted
CN
2008
93views more  CN 2008»
15 years 3 months ago
A fast algorithm for computing minimum routing cost spanning trees
Rui Campos, Manuel Ricardo
109
Voted
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 3 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
DCG
2008
69views more  DCG 2008»
15 years 3 months ago
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D
Pankaj K. Agarwal, Rolf Klein, Christian Knauer, S...