Sciweavers

8917 search results - page 129 / 1784
» Abstraction in Algorithm Animation
Sort
View
FOCI
2007
IEEE
15 years 1 months ago
Evolutionary Algorithms in the Presence of Noise: To Sample or Not to Sample
Abstract-- In this paper, we empirically analyze the convergence behavior of evolutionary algorithms (evolution strategies
Hans-Georg Beyer, Bernhard Sendhoff
MCU
2004
95views Hardware» more  MCU 2004»
14 years 11 months ago
Algorithmic Randomness, Quantum Physics, and Incompleteness
Abstract. Is randomness in quantum mechanics "algorithmically random"? Is there any relation between Heisenberg's uncertainty relation and G
Cristian Calude
CORR
2010
Springer
96views Education» more  CORR 2010»
14 years 7 months ago
A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
Abstract. In this paper a tight bound on the worst-case number of comparisons for Floyd's well known heap construction algorithm, is derived. It is shown that at most 2n - 2
Ioannis K. Paparrizos
SIAMMAX
2010
92views more  SIAMMAX 2010»
14 years 4 months ago
Solving a Structured Quadratic Eigenvalue Problem by a Structure-Preserving Doubling Algorithm
Abstract. In studying the vibration of fast trains, we encounter a palindromic quadratic eigenvalue problem (QEP) (2AT +Q+A)z = 0, where A, Q Cn
Chun-Hua Guo, Wen-Wei Lin
DMTCS
2011
261views Mathematics» more  DMTCS 2011»
13 years 9 months ago
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O(n5 log2 n).
Yury Person, Mathias Schacht