Sciweavers

4903 search results - page 843 / 981
» The Set Covering Machine
Sort
View
IPPS
1998
IEEE
14 years 1 months ago
A Molecular Quasi-Random Model of Computations Applied to Evaluate Collective Intelligence
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
Tadeusz Szuba
COCO
1998
Springer
123views Algorithms» more  COCO 1998»
14 years 1 months ago
Isolation, Matching, and Counting
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
Eric Allender, Klaus Reinhardt
FMCAD
1998
Springer
14 years 1 months ago
Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification
We present a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking. As a benchmark we take Tomasulo's algori...
Sergey Berezin, Armin Biere, Edmund M. Clarke, Yun...
KDD
1998
ACM
113views Data Mining» more  KDD 1998»
14 years 1 months ago
Targeting Business Users with Decision Table Classifiers
Business users and analysts commonly use spreadsheets and 2D plots to analyze and understand their data. On-line Analytical Processing (OLAP) provides these users with added flexi...
Ron Kohavi, Dan Sommerfield
KDD
1998
ACM
164views Data Mining» more  KDD 1998»
14 years 1 months ago
A Data Mining Support Environment and its Application on Insurance Data
Huge masses of digital data about products, customers and competitors have become available for companies in the services sector. In order to exploit its inherent (and often hidde...
Martin Staudt, Jörg-Uwe Kietz, Ulrich Reimer