4432 search results - page 154 / 887 » Solving Demodulation as an Optimization Problem |
155
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
161
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
177
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
187
click to vote
AIPS
2007
15 years 8 months ago
2007
The Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (mMAPTWTC) is a crew scheduling problem faced in several different context...
168
click to vote
GBRPR
2005
Springer
15 years 12 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...