Sciweavers

1578 search results - page 67 / 316
» Algorithmic randomness of continuous functions
Sort
View
PPSN
2000
Springer
15 years 1 months ago
Practical Implications of New Results in Conservation of Optimizer Performance
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
Thomas M. English
HPCC
2007
Springer
15 years 1 months ago
Energy-Aware Online Algorithm to Satisfy Sampling Rates with Guaranteed Probability for Sensor Applications
Abstract. Energy consumption is a major factor that limits the performance of sensor applications. Sensor nodes have varying sampling rates since they face continuously changing en...
Meikang Qiu, Edwin Hsing-Mean Sha
CORR
2007
Springer
117views Education» more  CORR 2007»
14 years 9 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 9 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
IEEEIAS
2009
IEEE
15 years 4 months ago
Analysis of One-way Alterable Length Hash Function Based on Cell Neural Network
: In this paper, a hash function construction method based on cell neural network (CNN) with hyper-chaos characteristics is proposed. The chaos sequence is generated by iterating C...
Qun-ting Yang, Tie-gang Gao, Li Fan, Qiao-lun Gu