2492 search results - page 365 / 499 » On the General Signature Trees |
157
click to vote
FOCS
1992
IEEE
15 years 9 months ago
1992
IEEE
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
182
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
136
click to vote
CP
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
171
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...
156
click to vote
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...