10988 search results - page 198 / 2198 » Algorithmic Folding Complexity |
144
Voted
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
143
Voted
CAE
2007
15 years 6 months ago
2007
In 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff's measure from an i...
142
Voted
TWC
2010
14 years 10 months ago
2010
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
175
Voted
SIGECOM
2011
ACM
14 years 6 months ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
118
Voted
EC
2000
15 years 3 months ago
2000
We evaluate whether John Holland's Echo model exemplifies his theory of complex adaptive systems. After reviewing Holland's theory of complex adaptive systems and descri...