Sciweavers

3212 search results - page 223 / 643
» Faster Concept Analysis
Sort
View
FM
2001
Springer
108views Formal Methods» more  FM 2001»
15 years 10 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
141
Voted
ECML
1997
Springer
15 years 10 months ago
Global Data Analysis and the Fragmentation Problem in Decision Tree Induction
We investigate an inherent limitation of top-down decision tree induction in which the continuous partitioning of the instance space progressively lessens the statistical support o...
Ricardo Vilalta, Gunnar Blix, Larry A. Rendell
ESORICS
1992
Springer
15 years 10 months ago
ASAX: Software Architecture and Rule-Based Language for Universal Audit Trail Analysis
After a brief survey of the problems related to audit trail analysis and of some approaches to deal with them, the paper outlines the project ASAX which aims at providing an advanc...
Naji Habra, Baudouin Le Charlier, Abdelaziz Mounji...
ESOP
2000
Springer
15 years 9 months ago
Polyvariant Flow Analysis with Constrained Types
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...
Scott F. Smith, Tiejun Wang
147
Voted
AAAI
1996
15 years 7 months ago
Post-Analysis of Learned Rules
Rule induction research implicitly assumes that after producing the rules from a dataset, these rules will be used directly by an expert system or a human user. In real-life appli...
Bing Liu, Wynne Hsu