Sciweavers

4103 search results - page 145 / 821
» Some results on the Collatz problem
Sort
View
JAIR
2000
152views more  JAIR 2000»
15 years 6 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
CORR
1998
Springer
82views Education» more  CORR 1998»
15 years 6 months ago
Tractability of Theory Patching
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
Shlomo Argamon-Engelson, Moshe Koppel
TC
2002
15 years 6 months ago
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
Jean-François Hermant, Gérard Le Lan...
IJAR
2010
130views more  IJAR 2010»
15 years 5 months ago
Learning locally minimax optimal Bayesian networks
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...
Tomi Silander, Teemu Roos, Petri Myllymäki
INFOCOM
2010
IEEE
15 years 5 months ago
Value-aware Resource Allocation for Service Guarantees in Networks
—The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixe...
Parimal Parag, Srinivas Shakkottai, Jean-Fran&cced...