3637 search results - page 465 / 728 » On Dynamic Bit-Probe Complexity |
184
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
Verification of reachability properties for probabilistic systems is usually based on variants of Markov processes. Current methods assume an exact model of the dynamic behavior a...
148
click to vote
ANOR
2010
15 years 6 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
172
click to vote
CCR
2008
15 years 6 months ago
2008
Modeling Internet growth is important both for understanding the current network and to predict and improve its future. To date, Internet models have typically attempted to explai...
178
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
As passive optical networks (PON) are increasingly deployed to provide high speed Internet access, it is important to understand their fundamental traffic capacity limits. The pape...
194
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take pa...