Sciweavers

507 search results - page 87 / 102
» Sizes of Ordered Decision Trees
Sort
View
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
14 years 1 months ago
Minimization of the expected path length in BDDs based on local changes
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
Rüdiger Ebendt, Wolfgang Günther, Rolf D...
AUSAI
2004
Springer
14 years 1 months ago
Set Bounds and (Split) Set Domain Propagation Using ROBDDs
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....
Peter Hawkins, Vitaly Lagoon, Peter J. Stuckey
NMR
2004
Springer
14 years 1 months ago
A SAT-based polynomial space algorithm for answer set programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
ANSS
2002
IEEE
14 years 22 days ago
Performance Analysis for Data Service in Third Generation Mobile Telecommunication Networks
The data traffic in wireless networks for the third generation (3G) mobile telecommunication systems should take into account a variety of services (voice, data, video) and envir...
Aloizio Pereira da Silva, Geraldo Robson Mateus
AGP
1998
IEEE
14 years 22 hour ago
Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitabl...
Roberto Bagnara, Peter Schachte