5316 search results - page 178 / 1064 » Which Search Problems Are Random |
128
Voted
STOC
2010
ACM
16 years 1 months ago
2010
ACM
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
153
click to vote
SIAMJO
2010
14 years 10 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
130
click to vote
ISCC
2007
IEEE
15 years 10 months ago
2007
IEEE
Window-based congestion control is typically based on exhausting bandwidth capacity, which occasionally leads to transient congestion. Moreover, flow synchronization may deteriora...
129
Voted
CRYPTO
1998
Springer
15 years 8 months ago
1998
Springer
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
98
Voted
CG
1998
Springer
15 years 8 months ago
1998
Springer
Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Public...