Sciweavers

844 search results - page 47 / 169
» Safraless Decision Procedures
Sort
View
CONCUR
2005
Springer
14 years 2 months ago
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
Abstract. We propose a polynomial-time decision procedure for hereditary history preserving bisimilarity (hhp-b) on Basic Parallel Processes (BPP). Furthermore, we give a sound and...
Sibylle B. Fröschle, Slawomir Lasota
CCS
1999
ACM
14 years 1 months ago
Proof-Carrying Authentication
We have designed and implemented a general and powerful distributed authentication framework based on higher-order logic. Authentication frameworks — including Taos, SPKI, SDSI,...
Andrew W. Appel, Edward W. Felten
ICML
1999
IEEE
14 years 9 months ago
The Alternating Decision Tree Learning Algorithm
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
Yoav Freund, Llew Mason
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
14 years 2 months ago
Effective Estimation of Posterior Probabilities: Explaining the Accuracy of Randomized Decision Tree Approaches
There has been increasing number of independently proposed randomization methods in different stages of decision tree construction to build multiple trees. Randomized decision tre...
Wei Fan, Ed Greengrass, Joe McCloskey, Philip S. Y...
KBSE
2010
IEEE
13 years 7 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer