Sciweavers

1252 search results - page 24 / 251
» Minimizing Learned Clauses
Sort
View
66
Voted
ICALT
2006
IEEE
15 years 3 months ago
The Generation of E-Learning Exercise Problems from Subject Ontologies
The teaching/ learning of cognitive skills, such as problem-solving, is an important goal in most forms of education. In well-structured subject areas certain exercise problem typ...
Edmond Holohan, Mark Melia, Declan McMullen, Claus...
COLT
2010
Springer
14 years 7 months ago
Regret Minimization With Concept Drift
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...
Koby Crammer, Yishay Mansour, Eyal Even-Dar, Jenni...
IJCNN
2007
IEEE
15 years 4 months ago
Evolving a Neural Net-Based Decision and Search Heuristic for DPLL SAT Solvers
— Solvers for the Boolean satisfiability problem are an important base technology for many applications. The most efficient SAT solvers for industrial applications are based on...
Raihan H. Kibria
CAV
2010
Springer
176views Hardware» more  CAV 2010»
15 years 3 days ago
Lazy Annotation for Program Testing and Verification
Abstract. We describe an interpolant-based approach to test generation and model checking for sequential programs. The method generates Floyd/Hoare style annotations of the program...
Kenneth L. McMillan
JSAT
2006
109views more  JSAT 2006»
14 years 9 months ago
Decomposing SAT Problems into Connected Components
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...
Armin Biere, Carsten Sinz