Sciweavers

209 search results - page 31 / 42
» Dealing with stochastic reachability
Sort
View
ATAL
2008
Springer
13 years 9 months ago
On the usefulness of opponent modeling: the Kuhn Poker case study
The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state inform...
Alessandro Lazaric, Mario Quaresimale, Marcello Re...
INFOCOM
2009
IEEE
14 years 2 months ago
On Leveraging Partial Paths in Partially-Connected Networks
Abstract—Mobile wireless network research focuses on scenarios at the extremes of the network connectivity continuum where the probability of all nodes being connected is either ...
Simon Heimlicher, Merkourios Karaliopoulos, Hanoch...
BMCBI
2005
98views more  BMCBI 2005»
13 years 7 months ago
The effects of normalization on the correlation structure of microarray data
Background: Stochastic dependence between gene expression levels in microarray data is of critical importance for the methods of statistical inference that resort to pooling test-...
Xing Qiu, Andrew I. Brooks, Lev Klebanov, Andrei Y...
DAC
1994
ACM
13 years 11 months ago
Exact Minimum Cycle Times for Finite State Machines
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
William K. C. Lam, Robert K. Brayton, Alberto L. S...
FIW
2003
120views Communications» more  FIW 2003»
13 years 9 months ago
A Policy Architecture for Enhancing and Controlling Features
Abstract. Features provide extensions to a basic service, but in new systems users require much greater flexibility oriented towards their needs. Traditional features do not easil...
Stephan Reiff-Marganiec, Kenneth J. Turner