3433 search results - page 179 / 687 » Heuristics for a bidding problem |
177
click to vote
EVOW
2007
Springer
16 years 22 days ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
155
click to vote
JUCS
2008
15 years 6 months ago
2008
: In this paper we propose a new approach to Swarm Intelligence called Two-Step Swarm Intelligence. The basic idea is to split the heuristic search performed by agents into two sta...
168
click to vote
MP
2006
15 years 6 months ago
2006
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical ( , S) inequalit...
188
click to vote
JCSS
2007
15 years 6 months ago
2007
Hidden Markov models (HMMs) are often used for biological sequence annotation. Each sequence feature is represented by a collection of states with the same label. In annotating a ...
161
click to vote
EDBT
2002
ACM
16 years 6 months ago
2002
ACM
Maintaining statistics on multidimensional data distributions is crucial for predicting the run-time and result size of queries and data analysis tasks with acceptable accuracy. To...