Sciweavers

2233 search results - page 28 / 447
» On the Complexity of Theory Curbing
Sort
View
96
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
Better bounds on the union complexity of locally fat objects
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
Mark de Berg
104
Voted
EC
2000
93views ECommerce» more  EC 2000»
15 years 1 months ago
Is Echo a Complex Adaptive System?
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...
Richard Smith, Mark A. Bedau
91
Voted
DCG
2006
90views more  DCG 2006»
15 years 1 months ago
Combinatorial Complexity of Convex Sequences
We show that the equation si1 + si2 +
Alex Iosevich, S. Konyagin, Michael Rudnev, V. Ten
ISAAC
2005
Springer
109views Algorithms» more  ISAAC 2005»
15 years 7 months ago
Recursion Theoretic Operators for Function Complexity Classes
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
Kenya Ueno
101
Voted
ATAL
2004
Springer
15 years 7 months ago
The Insufficiency of Formal Design Methods - The Necessity of an Experimental Approach - for the Understanding and Control of Co
We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...
Bruce Edmonds, Joanna Bryson