1512 search results - page 22 / 303 » When Suboptimal Rules |
KBSE
2007
IEEE
14 years 4 months ago
2007
IEEE
We describe a model-based construction of an online tester for black-box testing of implementation under test (IUT). The external behavior of the IUT is modeled as an output obser...
PAKDD
2004
ACM
14 years 3 months ago
2004
ACM
Although the task of mining association rules has received considerable attention in the literature, algorithms to find time association rules are often inadequate, by either miss...
SIGECOM
2008
ACM
13 years 9 months ago
2008
ACM
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
JUCS
2002
13 years 9 months ago
2002
: A purely communicative variant of P systems was considered recently, based on the trans-membrane transport of couples of chemicals. When using both symport rules (the chemicals p...
IPMU
1992
Springer
14 years 1 months ago
1992
Springer
This paper deals with the problem of inference under uncertain information. This is a generalization of a paper of Cardona et al. (1991a) where rules were not allowed to contain n...