4377 search results - page 511 / 876 » Mass problems and randomness |
164
click to vote
SPAA
2004
ACM
16 years 7 days ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
195
click to vote
SPIN
2004
Springer
16 years 5 days ago
2004
Springer
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
171
click to vote
APNOMS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Recently, researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The Bounded Random Drop (BRD), known...
187
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
208
click to vote
ISSTA
2010
ACM
15 years 8 months ago
2010
ACM
Testing object-oriented (OO) software is critical because OO languages are commonly used in developing modern software systems. In testing OO software, one important and yet chall...