Sciweavers

2189 search results - page 121 / 438
» A Graded Applicability of Rules
Sort
View
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 6 months ago
Mining The Successful Binary Combinations: Methodology and A Simple Case Study
The importance of finding the characteristics leading to either a success or a failure is one of the driving forces of data mining. The various application areas of finding succes...
Yuval Cohen
INFFUS
2006
104views more  INFFUS 2006»
15 years 6 months ago
Reasoning with multiple-source information in a possibilistic logic framework
This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. It presents several syntactic combination rules to merge possibilistic k...
Salem Benferhat, Claudio Sossai
BMCBI
2010
135views more  BMCBI 2010»
15 years 6 months ago
Simple and flexible classification of gene expression microarrays via Swirls and Ripples
Background: A simple classification rule with few genes and parameters is desirable when applying a classification rule to new data. One popular simple classification rule, diagon...
Stuart G. Baker
CADE
2002
Springer
16 years 6 months ago
A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
Robert R. Schneck, George C. Necula
ATAL
2007
Springer
16 years 16 days ago
Average-case tractability of manipulation in voting via the fraction of manipulators
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
Ariel D. Procaccia, Jeffrey S. Rosenschein