Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
8917
search results - page 129 / 1784
»
Abstraction in Algorithm Animation
Sort
relevance
views
votes
recent
update
View
thumb
title
189
click to vote
FOCI
2007
IEEE
199
views
Applied Computing
»
more
FOCI 2007
»
Evolutionary Algorithms in the Presence of Noise: To Sample or Not to Sample
15 years 10 months ago
Download
homepages.fhv.at
Abstract-- In this paper, we empirically analyze the convergence behavior of evolutionary algorithms (evolution strategies
Hans-Georg Beyer, Bernhard Sendhoff
claim paper
Read More »
154
click to vote
MCU
2004
95
views
Hardware
»
more
MCU 2004
»
Algorithmic Randomness, Quantum Physics, and Incompleteness
15 years 7 months ago
Download
www.cs.auckland.ac.nz
Abstract. Is randomness in quantum mechanics "algorithmically random"? Is there any relation between Heisenberg's uncertainty relation and G
Cristian Calude
claim paper
Read More »
162
click to vote
CORR
2010
Springer
96
views
Education
»
more
CORR 2010
»
A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
15 years 3 months ago
Download
www.swiss-experiment.ch
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
claim paper
Read More »
160
click to vote
SIAMMAX
2010
92
views
more
SIAMMAX 2010
»
Solving a Structured Quadratic Eigenvalue Problem by a Structure-Preserving Doubling Algorithm
15 years 1 months ago
Download
www.math.uregina.ca
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
claim paper
Read More »
280
click to vote
DMTCS
2011
261
views
Mathematics
»
more
DMTCS 2011
»
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
14 years 6 months ago
Download
www.math.uni-hamburg.de
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
claim paper
Read More »
« Prev
« First
page 129 / 1784
Last »
Next »