3433 search results - page 541 / 687 » Heuristics for a bidding problem |
181
click to vote
GECCO
2005
Springer
16 years 2 days ago
2005
Springer
We focus on the handling of overlapping solutions in evolutionary multiobjective optimization (EMO) algorithms. First we show that there exist a large number of overlapping soluti...
190
click to vote
ICANN
2005
Springer
16 years 2 days ago
2005
Springer
One aim of Meta-learning techniques is to minimize the time needed for problem solving, and the effort of parameter hand-tuning, by automating algorithm selection. The predictive m...
156
click to vote
WG
2005
Springer
16 years 16 hour ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
197
click to vote
MOBICOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
147
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...