Sciweavers

258 search results - page 16 / 52
» Relational Correspondences for Lattices with Operators
Sort
View
CPC
2010
117views more  CPC 2010»
13 years 4 months ago
On the Number of Perfect Matchings in Random Lifts
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
EUSFLAT
2003
119views Fuzzy Logic» more  EUSFLAT 2003»
13 years 9 months ago
Comparison of two approaches to approximated reasoning
A comparison is made of two approaches to approximate reasoning: Mamdani's interpolation method and the implication method. Both approaches are variants of Zadeh's compo...
Pim van den Broek
FATES
2004
Springer
14 years 27 days ago
A Test Generation Framework for quiescent Real-Time Systems
We present an extension of Tretmans’ theory and algorithm for test generation for input-output transition systems to real-time systems. Our treatment is based on an operational i...
Laura Brandán Briones, Ed Brinksma
DATAMINE
1998
126views more  DATAMINE 1998»
13 years 7 months ago
An Extension to SQL for Mining Association Rules
Data mining evolved as a collection of applicative problems and efficient solution algorithms relative to rather peculiar problems, all focused on the discovery of relevant infor...
Rosa Meo, Giuseppe Psaila, Stefano Ceri
IFM
2007
Springer
14 years 1 months ago
Unifying Theories of Objects
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...
Michael Anthony Smith, Jeremy Gibbons