Sciweavers

1695 search results - page 272 / 339
» Linear, Polynomial or Exponential
Sort
View
106
Voted
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 16 days ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
SIAMCOMP
2002
95views more  SIAMCOMP 2002»
15 years 15 days ago
Lower Bounds for Lucas Chains
Lucas chains are a special type of addition chains satisfying an extra condition: for the representation ak = aj + ai of each element ak in the chain, the difference aj - ai must a...
Martin Kutz
98
Voted
TOMACS
2002
101views more  TOMACS 2002»
15 years 15 days ago
Efficient simulation of a tandem Jackson network
In this paper we consider a two-node tandem Jackson network. Starting from a given state, we are interested in estimating the probability that the content of the second buffer exc...
Dirk P. Kroese, Victor F. Nicola
110
Voted
ER
2010
Springer
121views Database» more  ER 2010»
14 years 11 months ago
Reasoning with Optional and Preferred Requirements
Abstract. Of particular concern in requirements engineering is the selection of requirements to implement in the next release of a system. To that end, there has been recent work o...
Neil A. Ernst, John Mylopoulos, Alexander Borgida,...
103
Voted
IWSEC
2010
Springer
14 years 11 months ago
Optimal Adversary Behavior for the Serial Model of Financial Attack Trees
Abstract. Attack tree analysis is used to estimate different parameters of general security threats based on information available for atomic subthreats. We focus on estimating the...
Margus Niitsoo