260 search results - page 1 / 52 » Range and Set Abstraction using SAT |
ENTCS
2010
13 years 2 months ago
2010
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
nd Counterexample-Based Abstraction Niklas Een, Alan Mishchenko EECS Department, University of California Berkeley, USA. Nina Amla Cadence Research Laboratroy Berkeley, USA. This p...
RSFDGRC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
CP
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
AIMSA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...