5316 search results - page 14 / 1064 » Which Search Problems Are Random |
CP
2000
Springer
14 years 2 months ago
2000
Springer
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
WINE
2007
Springer
14 years 3 months ago
2007
Springer
We consider the problem of designing auctions with worst case revenue guarantees for sponsored search. This problem differs from previous work because of ad dependent clickthroug...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We analyze a simple random process in which a token is moved in the interval A = {0, . . . , n}: Fix a probability distribution
CP
2006
Springer
14 years 1 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
SAC
2004
ACM
14 years 3 months ago
2004
ACM
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...