1139 search results - page 142 / 228 » Bounded Ideation Theory |
DIALM
2005
ACM
13 years 9 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
IPCO
2008
13 years 9 months ago
2008
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
NETWORKING
2007
13 years 9 months ago
2007
This paper addresses the study of fundamental properties of stream-based content distribution services. We assume the presence of an overlay network with limited connectivity degre...
UAI
2001
13 years 9 months ago
2001
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
COLING
1992
13 years 9 months ago
1992
The process of finding the antecedent of zero pronoun, that is indispensable to Japanese language understanding, is the topic of this paper. Here we mainly concern with discourses...