5316 search results - page 20 / 1064 » Which Search Problems Are Random |
111
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—In wireless networks, how to select transmit power that maximizes throughput is a challenging problem. On one hand, transmissions at a high power level could increase interferen...
104
Voted
SIGIR
2006
ACM
15 years 6 months ago
2006
ACM
Traditional web link-based ranking schemes use a single score to measure a page’s authority without concern of the community from which that authority is derived. As a result, a...
100
Voted
INFORMS
2010
14 years 11 months ago
2010
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
110
Voted
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
152
click to vote
CEC
2008
IEEE
15 years 7 months ago
2008
IEEE
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...