1139 search results - page 77 / 228 » Bounded Ideation Theory |
AML
2008
13 years 9 months ago
2008
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
AUTOMATICA
2005
13 years 9 months ago
2005
This paper presents novel analysis results for input-to-state stability (ISS) that utilise dynamic programming techniques to characterise minimal ISS gains and transient bounds. Th...
JSC
2000
13 years 9 months ago
2000
This paper presents a generalization of a theorem of Saltman on the existence of generic extensions with group A G over an infinite field K, where A is abelian, using less restri...
ALDT
2009
Springer
14 years 3 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
EUROGP
2001
Springer
14 years 1 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...