Sciweavers

5793 search results - page 269 / 1159
» Individual communication complexity
Sort
View
ICCNMC
2005
Springer
16 years 6 days ago
Data Structure Optimization of AS_PATH in BGP
With the fast growing size and complexity of core network, the hash based data structure of current AS_PATH implementation in BGP is facing challenges in performance, mainly caused...
Weirong Jiang
MFCS
2004
Springer
16 years 1 days ago
Approximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
Andre Gronemeier
ISPDC
2003
IEEE
15 years 12 months ago
tuBiG - A Layered Infrastructure to Provide Support for Grid Functionalities
The paper presents a Java-based object-oriented system that offers a layered infrastructure to create the adequate framework for complex interactions between Grid components (e.g....
Lenuta Alboaie, Sabin C. Buraga, Sinica Alboaie
154
Voted
MMB
2001
Springer
15 years 11 months ago
Using Performance Models to Dynamically Control E-Business Performance
E-business workloads are quite complex as demonstrated by the hierarchical workload characterization discussed here. While these features may pose challenges to performance model ...
Daniel A. Menascé
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
15 years 10 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson