1278 search results - page 35 / 256 » The Complexity of Weighted Boolean |
KI
2006
Springer
13 years 7 months ago
2006
Springer
In this paper, we examine the performance of the two policies for keyword selection over standard document corpora of varying properties. While in corpus-based policy a single set ...
ICCD
2008
IEEE
14 years 4 months ago
2008
IEEE
- A gate level probabilistic error propagation model is presented which takes as input the Boolean function of the gate, the signal and error probabilities of the gate inputs, and ...
ADL
2000
Springer
14 years 2 hour ago
2000
Springer
A mediator system is a kind of a meta-search engine that provides a seamlessly integrated search service for diverse search engines (collections). Since collections of a mediator ...
DM
2006
13 years 7 months ago
2006
The class composition C K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f C, g1, . . . , gn K, is investigated. This composition C K is either...
ICANN
2003
Springer
14 years 26 days ago
2003
Springer
We discuss a Probably Approximate Correct (PAC) learning paradigm for Boolean formulas, which we call PAC meditation, where the class of formulas to be learnt is not known in advan...