Sciweavers

116 search results - page 2 / 24
» Bisimulation for Neighbourhood Structures
Sort
View
JMLR
2010
149views more  JMLR 2010»
13 years 18 days ago
Fast Committee-Based Structure Learning
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
Ernest Mwebaze, John A. Quinn
ENTCS
2002
108views more  ENTCS 2002»
13 years 5 months ago
Bisimulation Relations for Dynamical and Control Systems
In this paper we propose a new equivalence relation for dynamical and control systems called bisimulation. As the name implies this definition is inspired by the fundamental notio...
Esfandiar Haghverdi, Paulo Tabuada, George J. Papp...
ENTCS
2002
76views more  ENTCS 2002»
13 years 5 months ago
A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras
In [19] Rutten introduced the notion of weak bisimulations and weak bisimilarity for coalgebras of the functor F(X) = X +O. In the present paper I will introduce a notion of weak ...
Jan Rothe
DDECS
2006
IEEE
88views Hardware» more  DDECS 2006»
13 years 12 months ago
Minimization of Large State Spaces using Symbolic Branching Bisimulation
Abstract: Bisimulations in general are a powerful concept to minimize large finite state systems regarding some well-defined observational behavior. In contrast to strong bisimul...
Ralf Wimmer, Marc Herbstritt, Bernd Becker
CP
2005
Springer
13 years 11 months ago
Lookahead Saturation with Restriction for SAT
We present a new and more efficient heuristic by restricting lookahead saturation (LAS) with NVO (neighbourhood variable ordering) and DEW (dynamic equality weighting). We report o...
Anbulagan, John K. Slaney