13621 search results - page 308 / 2725 » Computability and Complexity in Self-assembly |
149
click to vote
IEEEARES
2010
IEEE
16 years 1 months ago
2010
IEEE
- An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexi...
160
click to vote
MFCS
2004
Springer
16 years 2 days ago
2004
Springer
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
285
Voted
POPL
2008
ACM
16 years 7 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
196
click to vote
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...
187
click to vote
IAT
2005
IEEE
16 years 9 days ago
2005
IEEE
Whenever independent, non-cooperative actors jointly have to solve a complex task, they need to coordinate their efforts. Typical examples of such task coordination problems are s...