1277 search results - page 77 / 256 » Terminating Decision Algorithms Optimally |
134
click to vote
TIT
2002
15 years 2 months ago
2002
We consider the problem of binary hypothesis testing using binary decisions from independent and identically distributed (i.i.d). sensors. Identical likelihood-ratio quantizers wit...
145
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Cooperative coevolution is often used to solve difficult optimization problems by means of problem decomposition. Its performance on this task is influenced by many design decisio...
159
click to vote
JSAC
2011
14 years 6 months ago
2011
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
140
click to vote
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
120
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
— We consider optimal control for general networks with both wireless and wireline components and time varying channels. A dynamic strategy is developed to support all traffic w...