4432 search results - page 174 / 887 » Solving Demodulation as an Optimization Problem |
106
Voted
AAAI
2006
15 years 4 months ago
2006
Planning under uncertainty has been well studied, but usually the uncertainty is in action outcomes. This work instead investigates uncertainty in the amount of time that actions ...
144
Voted
AUTOMATICA
2007
15 years 3 months ago
2007
The sensor scheduling problem can be formulated as a controlled hidden Markov model and this paper solves the problem when the state, observation and action spaces are continuous....
111
click to vote
AE
2007
Springer
15 years 9 months ago
2007
Springer
This paper focuses on the design of control strategies for Evolutionary Algorithms. We propose a method to encapsulate multiple parameters, reducing control to only one criterion. ...
152
click to vote
NIPS
2001
15 years 4 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
134
click to vote
UAI
2001
15 years 4 months ago
2001
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...