5153 search results - page 343 / 1031 » Introduction to Randomized Algorithms |
131
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
119
click to vote
CCGRID
2009
IEEE
15 years 11 months ago
2009
IEEE
— To optimize makespan and reliability for workflow applications, most existing works use list heuristics rather than genetic algorithms (GAs) which can usually give better solut...
127
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— In this paper, we propose a new algorithm, named JACC-G, for large scale optimization problems. The motivation is to improve our previous work on grouping and adaptive weightin...
157
click to vote
NTMS
2009
IEEE
15 years 11 months ago
2009
IEEE
—New approaches that generate secret keys from radio channel characteristics have been recently proposed. The security of these schemes usually relies on the reciprocity principl...
105
click to vote
ASIACRYPT
2009
Springer
15 years 11 months ago
2009
Springer
An r-collision for a function is a set of r distinct inputs with identical outputs. Actually finding r-collisions for a random map over a finite set of cardinality N requires at ...