Sciweavers

226 search results - page 8 / 46
» Dynamic Variable Ordering in CSPs
Sort
View
GLVLSI
2000
IEEE
87views VLSI» more  GLVLSI 2000»
14 years 1 months ago
Speeding up symbolic model checking by accelerating dynamic variable reordering
Symbolic Model checking is a widely used technique in sequential verification. As the size of the OBDDs and also the computation time depends on the order of the input variables,...
Christoph Meinel, Christian Stangier
JMLR
2010
194views more  JMLR 2010»
13 years 3 months ago
Graphical Gaussian modelling of multivariate time series with latent variables
In time series analysis, inference about causeeffect relationships among multiple times series is commonly based on the concept of Granger causality, which exploits temporal struc...
Michael Eichler
ICSE
2004
IEEE-ACM
14 years 9 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
ECAI
2006
Springer
14 years 24 days ago
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
Radu Marinescu 0002, Rina Dechter
CONSTRAINTS
2006
105views more  CONSTRAINTS 2006»
13 years 9 months ago
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
Y. Law, J. Lee