Sciweavers

5158 search results - page 122 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 10 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
HT
2005
ACM
14 years 3 months ago
What the geeks know: hypertext and the problem of literacy
Recent theories of hypertext usefully emphasize continuity with earlier media; but in the general social environment, this continuity is not well understood, and may even be oppos...
Stuart Moulthrop
EOR
2010
88views more  EOR 2010»
13 years 10 months ago
Monge extensions of cooperation and communication structures
Cooperation structures without any a priori assumptions on the combinatorial structure of feasible coalitions are studied and a general theory for marginal values, cores and conve...
Ulrich Faigle, Michel Grabisch, M. Heyne
ICDT
2009
ACM
130views Database» more  ICDT 2009»
14 years 10 months ago
Towards a theory of search queries
The need to manage diverse information sources has triggered the rise of very loosely structured data models, known as "dataspace models." Such information management sy...
George H. L. Fletcher, Jan Van den Bussche, Dirk V...
TPHOL
2005
IEEE
14 years 3 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison