Sciweavers

2214 search results - page 247 / 443
» complexity 2004
Sort
View
CCR
2004
89views more  CCR 2004»
15 years 4 months ago
Should we build Gnutella on a structured overlay?
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...
Miguel Castro, Manuel Costa, Antony I. T. Rowstron
CCR
2004
151views more  CCR 2004»
15 years 4 months ago
Practical verification techniques for wide-area routing
Protocol and system designers use verification techniques to analyze a system's correctness properties. Network operators need verification techniques to ensure the "cor...
Nick Feamster
139
Voted
CGF
2004
82views more  CGF 2004»
15 years 4 months ago
Scalable Behaviors for Crowd Simulation
Crowd simulation for virtual environments offers many challenges centered on the trade-offs between rich behavior, control and computational cost. In this paper we present a new a...
Mankyu Sung, Michael Gleicher, Stephen Chenney
COMCOM
2004
84views more  COMCOM 2004»
15 years 4 months ago
A self-extracting accurate modeling for bounded-delay video services
This article proposes the XGOP-B deterministic traffic model for MPEG video services requiring strict bounds on the quality of service provided by the network. The XGOP-B model ta...
Marcelo Dias de Amorim, Otto Carlos Muniz Bandeira...
CPC
2004
98views more  CPC 2004»
15 years 4 months ago
And/Or Trees Revisited
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
Brigitte Chauvin, Philippe Flajolet, Danièl...