Sciweavers

229 search results - page 37 / 46
» Bilateral Algorithms for Symbolic Abstraction
Sort
View
AAAI
2010
13 years 9 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon
APN
2007
Springer
14 years 1 months ago
Improving Static Variable Orders Via Invariants
Abstract. Choosing a good variable order is crucial for making symbolic state-space generation algorithms truly efficient. One such algorithm is the MDD-based Saturation algorithm ...
Gianfranco Ciardo, Gerald Lüttgen, Andy Jinqi...
ECAI
2000
Springer
14 years 1 days ago
Naive Bayes and Exemplar-based Approaches to Word Sense Disambiguation Revisited
Abstract. This paper describes an experimental comparison between two standard supervised learning methods, namely Naive Bayes and Exemplar–basedclassification, on the Word Sens...
Gerard Escudero, Lluís Màrquez, Germ...
COMPGEOM
1997
ACM
13 years 12 months ago
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
Hervé Brönnimann, Ioannis Z. Emiris, V...
ICCAD
1995
IEEE
127views Hardware» more  ICCAD 1995»
13 years 11 months ago
Hybrid decision diagrams
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...
Edmund M. Clarke, Masahiro Fujita, Xudong Zhao