Sciweavers

1615 search results - page 305 / 323
» Computer science and decision theory
Sort
View
MFCS
2007
Springer
14 years 3 months ago
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
Paul S. Bonsma, Luis Cereceda
SIGMETRICS
2006
ACM
104views Hardware» more  SIGMETRICS 2006»
14 years 3 months ago
Modeling adoptability of secure BGP protocols
Despite the existence of several secure BGP routing protocols, there has been little progress to date on actual adoption. Although feasibility for widespread adoption remains the ...
Haowen Chan, Debabrata Dash, Adrian Perrig, Hui Zh...
ICALP
2005
Springer
14 years 3 months ago
Stochastic Steiner Trees Without a Root
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
Anupam Gupta, Martin Pál
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
14 years 3 months ago
Model Checking Discounted Temporal Properties
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, tempor...
Luca de Alfaro, Marco Faella, Thomas A. Henzinger,...
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
14 years 2 months ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...