Amanote Research
Register
Sign In
On Using Satisfiability-Based Pruning Techniques in Covering Algorithms
doi 10.1109/date.2000.840296
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
V.M. Manquinho
J. Marques-Silva
Publisher
IEEE Comput. Soc
Related search
Prime Implicant Computation Using Satisfiability Algorithms
Novel Clustering-Based Pruning Algorithms
Pattern Analysis and Applications
Computer Vision
Pattern Recognition
Artificial Intelligence
New Algorithms for Exact Satisfiability
BRICS Report Series
Pruning Backpropagation Neural Networks Using Modern Stochastic Optimisation Techniques
Neural Computing and Applications
Artificial Intelligence
Software
A Fast Approach to Clustering Datasets Using DBSCAN and Pruning Algorithms
International Journal of Computer Applications
Mixed Parallel Execution of Algorithms for Satisfiability Problem
Pruning Algorithms for Pretropisms of Newton Polytopes
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
An Empirical Analysis of Pruning Techniques
Model-Based Diagnosis of Hybrid Systems Using Satisfiability Modulo Theory
Proceedings of the AAAI Conference on Artificial Intelligence
