Sciweavers

2584 search results - page 66 / 517
» On the Forward Checking Algorithm
Sort
View
SIROCCO
2008
13 years 9 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
IJCAI
2007
13 years 9 months ago
Scalable Diagnosability Checking of Event-Driven Systems
Diagnosability of systems is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. Generally, in the l...
Anika Schumann, Yannick Pencolé
MST
2010
79views more  MST 2010»
13 years 6 months ago
A Search Algorithm for Subshift Attractors of Cellular Automata
Abstract. We describe a heuristic algorithm which searches for spreading clopen sets of a cellular automaton. Then the algorithms searches for the corresponding subshift attractors...
Enrico Formenti, Petr Kurka, Ondrej Zahradní...
POPL
1993
ACM
14 years 1 days ago
Type Checking Type Classes
We study the type inference problem for a system with type classes as in the functional programminglanguage Haskell. Type classes are an extension of ML-style polymorphismwith ove...
Tobias Nipkow, Christian Prehofer
TACAS
1997
Springer
132views Algorithms» more  TACAS 1997»
14 years 2 days ago
Test Generation for Intelligent Networks Using Model Checking
We study the use of model checking techniques for the generation of test sequences. Given a formal model of the system to be tested, one can formulate test purposes. A model checke...
André Engels, Loe M. G. Feijs, Sjouke Mauw