4432 search results - page 122 / 887 » Solving Demodulation as an Optimization Problem |
117
Voted
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
The performance of a kernel-based learning algorithm depends very much on the choice of the kernel. Recently, much attention has been paid to the problem of learning the kernel it...
139
click to vote
ALDT
2009
Springer
15 years 9 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 ...
123
click to vote
ICC
2008
IEEE
15 years 9 months ago
2008
IEEE
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...
134
click to vote
AAAI
2007
15 years 5 months ago
2007
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
127
click to vote
CCO
2001
Springer
15 years 7 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...