Sciweavers

2266 search results - page 416 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
ACM
1995
15 years 5 months ago
Rough Sets
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
Zdzislaw Pawlak
KDD
1997
ACM
154views Data Mining» more  KDD 1997»
15 years 5 months ago
Autonomous Discovery of Reliable Exception Rules
This paper presents an autonomous algorithm for discovering exception rules from data sets. An exception rule, which is defined as a deviational pattern to a well-known fact, exhi...
Einoshin Suzuki
BIRTHDAY
2008
Springer
15 years 3 months ago
The Church-Turing Thesis over Arbitrary Domains
The Church-Turing Thesis has been the subject of many variations and interpretations over the years. Specifically, there are versions that refer only to functions over the natural ...
Udi Boker, Nachum Dershowitz
ESEM
2008
ACM
15 years 3 months ago
A constrained regression technique for cocomo calibration
Building cost estimation models is often considered a search problem in which the solver should return an optimal solution satisfying an objective function. This solution also nee...
Vu Nguyen, Bert Steece, Barry W. Boehm
AAAI
2004
15 years 2 months ago
Additive versus Multiplicative Clause Weighting for SAT
This paper examines the relative performance of additive and multiplicative clause weighting schemes for propositional satisfiability testing. Starting with one of the most recent...
John Thornton, Duc Nghia Pham, Stuart Bain, Valnir...