5316 search results - page 161 / 1064 » Which Search Problems Are Random |
132
Voted
SAT
2004
Springer
15 years 9 months ago
2004
Springer
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
165
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
139
Voted
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
160
Voted
JBI
2004
15 years 5 months ago
2004
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...
154
Voted
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We present an on-line learning framework tailored towards real-time learning from observed user behavior in search engines and other information retrieval systems. In particular, ...