Sciweavers

19 search results - page 3 / 4
» Exploiting Graph Properties of Game Trees
Sort
View
MOBIHOC
2012
ACM
11 years 7 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
CMS
2006
175views Communications» more  CMS 2006»
13 years 6 months ago
Attack Graph Based Evaluation of Network Security
Abstract. The perspective directions in evaluating network security are simulating possible malefactor's actions, building the representation of these actions as attack graphs...
Igor V. Kotenko, Mikhail Stepashkin
FMSD
2007
97views more  FMSD 2007»
13 years 5 months ago
On the optimal reachability problem of weighted timed automata
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
Patricia Bouyer, Thomas Brihaye, Véronique ...
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
13 years 11 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 5 months ago
Exploring networks with traceroute-like probes: theory and simulations
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
Luca Dall'Asta, J. Ignacio Alvarez-Hamelin, Alain ...