282 search results - page 39 / 57 » Propositional Fusion Rules |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
ICIAP
2005
ACM
14 years 1 months ago
2005
ACM
Abstract. Fingerprints are one of the most used biometrics for automatic personal authentication. Unfortunately, it is often difficult to design fingerprint matchers exhibiting th...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper, we study the reliable decentralized supervisory control of discrete event systems (DESs) under the general architecture, in which the decision for controllable event...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
ACT We consider the problem of sensor selection in resource constrained sensor networks. The fusion center selects a subset of k sensors from an available pool of m sensors accordi...