Sciweavers

2584 search results - page 13 / 517
» On the Forward Checking Algorithm
Sort
View
EDBT
2009
ACM
138views Database» more  EDBT 2009»
14 years 2 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
CP
1995
Springer
13 years 11 months ago
Optimization-based Heuristics for Maximal Constraint Satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
Javier Larrosa, Pedro Meseguer
WIA
2007
Springer
14 years 1 months ago
Backward and Forward Bisimulation Minimisation of Tree Automata
We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Mini...
Johanna Högberg, Andreas Maletti, Jonathan Ma...
ECLIPSE
2004
ACM
14 years 1 months ago
Supporting model checking education using BOGOR/Eclipse
This paper describes our effort on developing educational materials on model checking to help foster the adoption of software model checking. We describe the course materials tha...
Matthew B. Dwyer, John Hatcliff, Matthew Hoosier
ISTCS
1992
Springer
13 years 11 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit