14518 search results - page 225 / 2904 » Two Problems for Sophistication |
94
Voted
STOC
2002
ACM
16 years 1 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
83
Voted
STOC
2001
ACM
16 years 1 months ago
2001
ACM
We consider the problem of partitioning n integers chosen randomly between 1 and 2m into two subsets such that the discrepancy, the absolute value of the difference of their sums,...
CEC
2008
IEEE
15 years 7 months ago
2008
IEEE
— This paper presents an algorithm which combines Estimation Distribution Algorithm with a chromosome compression scheme to solve large scale Noisy OneMax problem. The search spa...
PAIRING
2007
Springer
15 years 6 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
83
Voted
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper describes and analyzes the aggregation pheromone system (APS) algorithm, which extends ant colony optimization (ACO) to continuous domains. APS uses the collective behav...