1368 search results - page 196 / 274 » Generalized Rook Polynomials |
157
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
178
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Resource-Limited Genetic Programming is a bloat control technique that imposes a single limit on the total amount of resources available to the entire population, where resources ...
166
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
149
click to vote
WINE
2005
Springer
15 years 11 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
149
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...