Sciweavers

210 search results - page 24 / 42
» Universal Booleanization of Constraint Models
Sort
View
DAC
2002
ACM
14 years 10 months ago
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
Malay K. Ganai, Pranav Ashar, Aarti Gupta, Lintao ...
RTSS
2005
IEEE
14 years 3 months ago
Fast On-the-Fly Parametric Real-Time Model Checking
This paper presents a local algorithm for solving the universal parametric real-time model-checking problem. The problem may be phrased as follows: given a real-time system and te...
Dezhuang Zhang, Rance Cleaveland
FASE
2001
Springer
14 years 2 months ago
A Logic for the Java Modeling Language JML
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
Bart Jacobs, Erik Poll
GECCO
2009
Springer
14 years 4 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
SOFSEM
1999
Springer
14 years 1 months ago
Coherent Concepts, Robust Learning
We study learning scenarios in which multiple learners are involved and “nature” imposes some constraints that force the predictions of these learners to behave coherently. Thi...
Dan Roth, Dmitry Zelenko