14158 search results - page 232 / 2832 » Generalized switch-setting problems |
146
click to vote
COCO
2007
Springer
16 years 22 days ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
153
click to vote
GECCO
2007
Springer
16 years 21 days ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
164
click to vote
GECCO
2007
Springer
16 years 21 days ago
2007
Springer
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
174
click to vote
SAC
2005
ACM
16 years 3 days ago
2005
ACM
In this paper, we propose a multi-agent approach for solving a class of optimization problems involving expensive resources, where monolithic local search schemes perform miserabl...
154
click to vote
GECCO
2005
Springer
16 years 2 days ago
2005
Springer
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...