Sciweavers

113 search results - page 13 / 23
» Solving Boolean Equations Using ROSOP Forms
Sort
View
FLAIRS
2007
15 years 2 months ago
Learning to Identify Global Bottlenecks in Constraint Satisfaction Search
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
Diarmuid Grimes, Richard J. Wallace
127
Voted
FLAIRS
2009
14 years 10 months ago
Advanced Measures for Empirical Testing
Empirical testing is a very popular evaluation method for the development of intelligent systems. Here, previously solved problems with correct solutions are given as cases to the...
Joachim Baumeister
115
Voted
UAI
2008
15 years 2 months ago
Discovering Cyclic Causal Models by Independent Components Analysis
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
Gustavo Lacerda, Peter Spirtes, Joseph Ramsey, Pat...
CSCLP
2008
Springer
15 years 2 months ago
Challenges in Constraint-Based Analysis of Hybrid Systems
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
Andreas Eggers, Natalia Kalinnik, Stefan Kupfersch...
85
Voted
ARITH
2005
IEEE
15 years 6 months ago
A Linear-System Operator Based Scheme for Evaluation of Multinomials
We present a radix-2 online computational scheme for evaluating multinomials in a fixed-point number representation system. Its main advantage is that it can adapt to any evaluat...
Pavan Adharapurapu, Milos D. Ercegovac