2626 search results - page 88 / 526 » The complexity of stochastic sequences |
118
click to vote
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
100
click to vote
STOC
2009
ACM
16 years 15 days ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
104
click to vote
CCECE
2009
IEEE
15 years 6 months ago
2009
IEEE
The inverse diffusion problems deal with the estimation of many crucial parameters such as the diffusion coefficient, source properties, and boundary conditions. Such algorithms ...
117
click to vote
COCO
1994
Springer
15 years 4 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
RIVF
2007
15 years 1 months ago
2007
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...