2373 search results - page 52 / 475 » Complexities for generalized models of self-assembly |
284
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
140
click to vote
IJCAI
2001
15 years 5 months ago
2001
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
194
Voted
CC
2010
Springer
15 years 2 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...
133
click to vote
POLICY
2007
Springer
15 years 10 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...
164
click to vote
ALT
2010
Springer
15 years 4 months ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...