1547 search results - page 69 / 310 » Randomized Variable Elimination |
115
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
Existing test problems for multi-objective optimization are criticized for not having adequate linkages among variables. In most problems, the Pareto-optimal solutions correspond ...
223
click to vote
CP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. During this decade, it has been observed that many realworld graphs, like the web and some social and metabolic networks, have a scale-free structure. These graphs are ch...
105
click to vote
STOC
2002
ACM
16 years 3 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
118
click to vote
CPC
2006
15 years 3 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
111
Voted
RSA
2008
15 years 2 months ago
2008
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...