5153 search results - page 461 / 1031 » Introduction to Randomized Algorithms |
174
click to vote
EVOW
2004
Springer
15 years 11 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
133
Voted
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
152
click to vote
ASIACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
We study a class of problems called Modular Inverse Hidden Number Problems (MIHNPs). The basic problem in this class is the following: Given many pairs xi, msbk (α + xi)−1 mod p...
205
click to vote
RANDOM
2001
Springer
15 years 10 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
141
click to vote
ICRA
1994
IEEE
15 years 10 months ago
1994
IEEE
There is a close relationship between harmonic functions { which have recently been proposed for path planning { and hitting probabilities for random processes. The hitting probab...