1277 search results - page 95 / 256 » Terminating Decision Algorithms Optimally |
121
click to vote
IJCAI
2007
15 years 4 months ago
2007
We investigate search problems under risk in statespace graphs, with the aim of finding optimal paths for risk-averse agents. We consider problems where uncertainty is due to the...
116
click to vote
DAC
1999
ACM
16 years 4 months ago
1999
ACM
In this paper, we establish a theoretical framework for a new concept of scheduling called soft scheduling. In contrasts to the traditional schedulers referred as hard schedulers,...
116
click to vote
WIMOB
2008
IEEE
15 years 9 months ago
2008
IEEE
—In this paper, we propose two robust precoder designs for multiple-input multiple-output (MIMO) broadcast channels with imperfect channel state information (CSI). First, we cons...
144
click to vote
EDCC
2010
Springer
15 years 8 months ago
2010
Springer
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
128
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...