Sciweavers

5158 search results - page 175 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
ENTCS
2007
121views more  ENTCS 2007»
15 years 6 months ago
Rewrite-Based Decision Procedures
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
Maria Paola Bonacina, Mnacho Echenim
FSS
2007
82views more  FSS 2007»
15 years 6 months ago
An empirical test of some measurement-theoretic axioms for fuzzy sets
In the previous years some authors have been elaborating on the measurementtheoretic foundations of fuzzy set theory. A well-known problem in this approach is the difficult applic...
C. Desimpelaere, Thierry Marchant
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Mechanism design over discrete domains
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
Ahuva Mu'alem, Michael Schapira
TSP
2008
89views more  TSP 2008»
15 years 6 months ago
Optimal Filters on the Sphere
We derive optimal filters on the sphere in the context of detecting compact objects embedded in a stochastic background process. The matched filter and the scale adaptive filter ar...
Jason D. McEwen, Michael P. Hobson, Anthony N. Las...
AML
2002
69views more  AML 2002»
15 years 6 months ago
Transfer principles in nonstandard intuitionistic arithmetic
Using a slight generalization, due to Palmgren, of sheaf semantics, we present a term-model construction that assigns a model to any first-order intuitionistic theory. A modificat...
J. Avigad, Jeremy Helzner