Sciweavers

3353 search results - page 69 / 671
» Laver and set theory
Sort
View
COMPLEXITY
2010
124views more  COMPLEXITY 2010»
14 years 7 months ago
Spatially embedded dynamics and complexity
To gain a deeper understanding of the impact of spatial embedding on the dynamics of complex systems we employ a measure of interaction complexity developed within neuroscience us...
Christopher L. Buckley, Seth Bullock, Lionel Barne...
JMLR
2010
92views more  JMLR 2010»
14 years 4 months ago
Posterior distributions are computable from predictive distributions
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
Cameron E. Freer, Daniel M. Roy
MST
2010
117views more  MST 2010»
14 years 4 months ago
The 1-Versus-2 Queries Problem Revisited
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
Rahul Tripathi
IEEEICCI
2006
IEEE
15 years 3 months ago
Rough Set Method Based on Multi-Granulations
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on universe. In the view of granular computing, classical ro...
Y. H. Qian, J. Y. Liang
SEMWEB
2005
Springer
15 years 3 months ago
Modeling the Non-Expected Choice: A Weighted Utility Logit
This work derives and simulates two choice models applying the weighted utility theory, a generalization of the expected utility theory. It shows one set of assumptions, which jus...
Pia Koskenoja