8647 search results - page 190 / 1730 » The Container Selection Problem |
148
click to vote
GLOBECOM
2010
IEEE
15 years 22 days ago
2010
IEEE
Abstract-- A new approach to distributed cooperative beamforming in two-way half-duplex relay networks with frequency selective channels is proposed. In our scheme, two transceiver...
130
Voted
TCS
2011
14 years 10 months ago
2011
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
193
click to vote
PATAT
2004
Springer
15 years 8 months ago
2004
Springer
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
115
Voted
CCCG
2007
15 years 4 months ago
2007
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
123
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
We formalize the associative bandit problem framework introduced by Kaelbling as a learning-theory problem. The learning environment is modeled as a k-armed bandit where arm payof...