Sciweavers

4128 search results - page 681 / 826
» Learning and using relational theories
Sort
View
SAC
2010
ACM
15 years 5 months ago
Estimating node similarity from co-citation in a spatial graph model
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
Jeannette Janssen, Pawel Pralat, Rory Wilson
ICFEM
2009
Springer
15 years 4 months ago
Qualitative Action Systems
An extension to action systems is presented facilitating the modeling of continuous behavior in the discrete domain. The original action system formalism has been developed by Back...
Bernhard K. Aichernig, Harald Brandl, Willibald Kr...
90
Voted
TLCA
2007
Springer
15 years 4 months ago
Computation by Prophecy
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Ana Bove, Venanzio Capretta
LICS
2003
IEEE
15 years 3 months ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais
ATVA
2006
Springer
83views Hardware» more  ATVA 2006»
15 years 1 months ago
A Fresh Look at Testing for Asynchronous Communication
Testing is one of the fundamental techniques for verifying if a computing system conforms to its specification. We take a fresh look at the theory of testing for message-passing sy...
Puneet Bhateja, Paul Gastin, Madhavan Mukund