3455 search results - page 222 / 691 » Generalized Game Trees |
192
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
174
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
163
click to vote
IWSEC
2010
Springer
15 years 5 months ago
2010
Springer
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...
191
click to vote
CIAC
2010
Springer
16 years 3 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
166
click to vote
CCS
2007
ACM
16 years 23 days ago
2007
ACM
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...