5316 search results - page 194 / 1064 » Which Search Problems Are Random |
129
Voted
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
138
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
141
click to vote
TIT
1998
15 years 3 months ago
1998
—We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e., ...
140
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
The capability of multi-objective evolutionary algorithms (MOEAs) to handle premature convergence is critically important when applied to real-world problems. Their highly multi-mo...
159
click to vote
ICMLA
2008
15 years 5 months ago
2008
When using the output of classifiers to calculate the expected utility of different alternatives in decision situations, the correctness of predicted class probabilities may be of...