1041 search results - page 11 / 209 » Randomizing Reductions of Search Problems |
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
CP
2000
Springer
14 years 12 hour 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...
AAAI
1994
13 years 9 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
SAT
2010
Springer
13 years 6 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...