2479 search results - page 237 / 496 » Random Event Structures |
226
click to vote
TAINN
2005
Springer
16 years 2 days ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
147
Voted
WAC
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. There is an increasing consensus that existing mobility models, such as the well-known random walk or random waypoint models, are insufficient to represent real node mobi...
165
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract— It has been claimed that multicast state cannot be aggregated. In this paper, we will debunk this myth and present a simple technique that can be used to aggregate mult...
148
click to vote
ASIACRYPT
2000
Springer
15 years 11 months ago
2000
Springer
Block ciphers are usually based on one top-level scheme into which we plug “round functions”. To analyze security, it is important to study the intrinsic security provided by t...
186
click to vote
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...