1041 search results - page 101 / 209 » Randomizing Reductions of Search Problems |
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We study online profit-maximizing auctions for digital goods with adversarial bid selection and uniformly random arrivals. Our goal is to design auctions that are constant competit...
KBSE
2007
IEEE
14 years 2 months ago
2007
IEEE
Randomized testing has been shown to be an effective method for testing software units. However, the thoroughness of randomized unit testing varies widely according to the settin...
COR
2010
13 years 8 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Query-based web search is an integral part of many people’s daily activities. Most do not realize that their search history can be used to identify them (and their interests). I...