3415 search results - page 542 / 683 » Lower Bounds for Kernelizations |
142
click to vote
FCT
2005
Springer
15 years 10 months ago
2005
Springer
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
136
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
137
click to vote
IMA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and Vazirani, who proved independently that O(log...
121
click to vote
IPSN
2005
Springer
15 years 10 months ago
2005
Springer
— Lifetime maximization is one key element in the design of sensor-network-based surveillance applications. We propose a protocol for node sleep scheduling that guarantees a boun...
148
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...