11151 search results - page 208 / 2231 » On the Complexity of Model Expansion |
272
click to vote
CC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
218
click to vote
CIDU
2010
15 years 5 months ago
2010
Networks have been used to describe and model a wide range of complex systems, both natural as well as man-made. One particularly interesting application in the earth sciences is t...
187
click to vote
POLICY
2007
Springer
16 years 1 months ago
2007
Springer
This paper presents ongoing research and current results on the development of flexible access control infrastructure for complex resource provisioning (CRP) in Grid-based applica...
228
click to vote
JMLR
2006
15 years 7 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
197
click to vote
JCST
2010
15 years 2 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...