Sciweavers

121 search results - page 6 / 25
» Adaptive Application of SAT Solving Techniques
Sort
View
ICTAI
2003
IEEE
14 years 1 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
14 years 4 months ago
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
INTERSPEECH
2010
13 years 2 months ago
On speaker adaptive training of artificial neural networks
In the paper we present two techniques improving the recognition accuracy of multilayer perceptron neural networks (MLP ANN) by means of adopting Speaker Adaptive Training. The us...
Jan Trmal, Jan Zelinka, Ludek Müller
JUCS
2008
148views more  JUCS 2008»
13 years 8 months ago
SHARP Online: An Adaptive Hypermedia System Applied to Mathematical Problem Solving
: In this article we present the development of a web application called SHARP Online: An Adaptive Hypermedia System Applied to Mathematical Problem Solving. The pedagogical basis ...
Ana Belén Gil, Raquel Rodríguez, Fra...
TACAS
2010
Springer
191views Algorithms» more  TACAS 2010»
14 years 2 months ago
Blocked Clause Elimination
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...
Matti Järvisalo, Armin Biere, Marijn Heule