Search results for "Boolean decision"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Claire Kenyon, Valerie King	On Boolean Decision Trees with Faulty Nodes.	ISTCS	1992	DBLP DOI BibTeX RDF
1	Weiqing Guo, Yu Zhong, Tom Burd	Context-sensitive static transistor-level IR analysis.	ICCAD	2008	DBLP DOI BibTeX RDF
1	Camilo Rocha, José Meseguer	Theorem Proving Modulo Based on Boolean Equational Procedures.	RelMiCS	2008	DBLP DOI BibTeX RDF
1	Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Srivastava	Fast Identification of Relational Constraint Violations.	ICDE	2007	DBLP DOI BibTeX RDF
1	David Madigan, Sushil Mittal, Fred Roberts	Sequential Decision Making Algorithms for Port of Entry Inspection: Overcoming Computational Challenges.	ISI	2007	DBLP DOI BibTeX RDF
1	Zhi-Hong Tao, Cong-Hua Zhou, Zhong Chen, Li-Fu Wang	Bounded Model Checking of CTL.	J. Comput. Sci. Technol.	2007	DBLP DOI BibTeX RDF	symbolic model checking, bounded model checking, QBF, CTL*
1	Matthias Krause	On the computational power of Boolean decision lists.	Computational Complexity	2006	DBLP DOI BibTeX RDF	94C05, Subject classification. 68Q15, 06E30, 94C10
1	Saket Anand, David Madigan, Richard J. Mammone, Saumitr Pathak, Fred Roberts	Experimental Analysis of Sequential Decision Making Algorithms for Port of Entry Inspection Procedures.	ISI	2006	DBLP DOI BibTeX RDF
1	Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis	Exponential separation of quantum and classical one-way communication complexity.	STOC	2004	DBLP DOI BibTeX RDF	hidden matching, quantum computation, communication complexity, separation
1	T. S. Jayram, Ravi Kumar, D. Sivakumar	Two applications of information complexity.	STOC	2003	DBLP DOI BibTeX RDF
1	Matthias Krause	On the Computational Power of Boolean Decision Lists.	STACS	2002	DBLP DOI BibTeX RDF	Boolean Complexity Theory, Lower Bounds, Learnability
1	Scott Hazelhurst, Adi Attar, Raymond Sinnappan	Algorithms for Improving the Dependability of Firewall and Filter Rule Lists.	DSN	2000	DBLP DOI BibTeX RDF	Boolean decision diagrams, validation, filtering, firewalls, traffic management
1	Susan T. Dumais, Hao Chen	Hierarchical classification of Web content.	SIGIR	2000	DBLP DOI BibTeX RDF	Web hierarchies, text catergorization, machine learning, classification, World Wide Web (WWW), support vector machines, text classification, hierarchical models
1	Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin	Arthur-Merlin Games in Boolean Decision Trees.	J. Comput. Syst. Sci.	1999	DBLP DOI BibTeX RDF
1	Armin Biere, Alessandro Cimatti, Edmund M. Clarke, Yunshan Zhu	Symbolic Model Checking without BDDs.	TACAS	1999	DBLP DOI BibTeX RDF
1	Nikolai K. Vereshchagin	Randomized Boolean Decision Trees: Several Remarks.	Theor. Comput. Sci.	1998	DBLP DOI BibTeX RDF
1	William S. Evans, Nicholas Pippenger	Average-Case Lower Bounds for Noisy Boolean Decision Trees.	SIAM J. Comput.	1998	DBLP DOI BibTeX RDF
1	Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin	Arthur-Merlin Games in Boolean Decision Trees. (PDF / PS)	IEEE Conference on Computational Complexity	1998	DBLP DOI BibTeX RDF
1	Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin	Arthur-Merlin Games in Boolean Decision Trees	Electronic Colloquium on Computational Complexity (ECCC)	1997	DBLP BibTeX RDF
1	Jeffery P. Hansen, Masatoshi Sekine	Synthesis by Spectral Translation Using Boolean Decision Diagrams.	DAC	1996	DBLP DOI BibTeX RDF
1	William S. Evans, Nicholas Pippenger	Lower Bounds for Noisy Boolean Decision Trees.	STOC	1996	DBLP DOI BibTeX RDF
1	Wojciech Ziarko, Nick Cercone, Xiaohua Hu	Rule Discovery from Databases with Decision Matrices.	ISMIS	1996	DBLP DOI BibTeX RDF
1	Miklos Santha	On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae.	Random Struct. Algorithms	1995	DBLP DOI BibTeX RDF
1	Stefan Arnborg	Decomposable Structures, Boolean Function Representations, and Optimization.	MFCS	1995	DBLP DOI BibTeX RDF
1	Claire Kenyon, Valerie King	On Boolean Decision Trees with Faulty Nodes.	Random Struct. Algorithms	1994	DBLP DOI BibTeX RDF
1	Alan J. Hu, David L. Dill	Efficient Verification with BDDs using Implicitly Conjoined Invariants.	CAV	1993	DBLP DOI BibTeX RDF
1	Alan J. Hu, David L. Dill, Andreas J. Drexler, C. Han Yang	Higher-Level Specification and Verification with BDDs.	CAV	1992	DBLP DOI BibTeX RDF
1	Miklos Santha	On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae.	Structure in Complexity Theory Conference	1991	DBLP BibTeX RDF
1	László Lovász, Moni Naor, Ilan Newman, Avi Wigderson	Search Problems in the Decision Tree Model (Preliminary Version)	FOCS	1991	DBLP DOI BibTeX RDF	Boolean decision tree model, CNF search, complexities, randomness, search problems, determinism, nondeterminism
1	Rüdiger Reischuk, Bernd Schmeltz	Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound	FOCS	1991	DBLP DOI BibTeX RDF	noisy decision tree complexity, tree depth, noisy circuits, critical number, static Boolean decision trees, erroneous answers, noisy dynamic decision trees, lower bound, Boolean functions, computational model, Boolean circuits, questions, answers
1	Ingo Wegener	On the complexity of branching programs and decision trees for clique functions.	J. ACM	1988	DBLP DOI BibTeX RDF
1	Michael E. Saks, Avi Wigderson	Probabilistic Boolean Decision Trees and the Complexity of Evaluating Game Trees	FOCS	1986	DBLP DOI BibTeX RDF
1	Vojin M. Plavsic, Per-Erik Danielsson	Sequential Evaluation of Boolean Functions.	IEEE Trans. Computers	1979	DBLP DOI BibTeX RDF	sequential evaluation, Boolean decision, data base search, evaluation of Boolean expressions, fast evaluation, hierarchical Boolean functions, multilevel Boolean functions, partial evaluation