Sciweavers

3717 search results - page 25 / 744
» Representing Multiple Theories
Sort
View
ECSQARU
2007
Springer
14 years 1 months ago
Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory
The binary representation is widely used for representing focal sets of Dempster-Shafer belief functions because it allows to compute efficiently all relevant operations. However, ...
Norbert Lehmann
ENTCS
2007
89views more  ENTCS 2007»
13 years 7 months ago
Hierarchical Nominal Terms and Their Theory of Rewriting
Nominal rewriting introduced a novel method of specifying rewriting on syntax-with-binding. We extend this treatment of rewriting with hierarchy of variables representing increasi...
Murdoch Gabbay
ALGORITHMICA
2006
63views more  ALGORITHMICA 2006»
13 years 7 months ago
A Local Limit Theorem in the Theory of Overpartitions
Abstract. An overpartition of an integer n is a partition where the last occurrence of a part can be overlined. We study the weight of the overlined parts of an overpartition count...
Sylvie Corteel, William M. Y. Goh, Pawel Hitczenko
MFCS
1990
Springer
13 years 11 months ago
On Checking Versus Evaluation of Multiple Queries
The plausibility of computing the answers to many membership queries to a hard set with few queries is the subject of the theory of terseness. In this paper, we develop companion ...
William I. Gasarch, Lane A. Hemachandra, Albrecht ...
EOR
2006
74views more  EOR 2006»
13 years 7 months ago
A set theoretic framework for enumerating matches in surveys and its application to reducing inaccuracies in vehicle roadside su
This paper describes a framework for analysing matches in multiple data sets. The framework described is quite general and can be applied to a variety of problems where matches ar...
Richard G. Clegg