7065 search results - page 1071 / 1413 » Iterative Scheduling Algorithms |
180
click to vote
IJCAI
2001
15 years 8 months ago
2001
Most formulations of Reinforcement Learning depend on a single reinforcement reward value to guide the search for the optimal policy solution. If observation of this reward is rar...
171
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
207
click to vote
NIPS
2003
15 years 8 months ago
2003
In order to understand AdaBoost’s dynamics, especially its ability to maximize margins, we derive an associated simplified nonlinear iterated map and analyze its behavior in lo...
197
click to vote
UAI
1997
15 years 8 months ago
1997
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...
215
click to vote
ADHOCNOW
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. This paper investigates the challenges involve in designing a dynamic channel assignment (DCA) scheme for wireless mesh networks, particularly for multi-radio systems. It...