Sciweavers

2778 search results - page 232 / 556
» Limit complexities revisited
Sort
View
CN
2006
106views more  CN 2006»
15 years 6 months ago
Efficient large-scale BGP simulations
Simulation has been the method of choice for analyzing large, complex, and highly volatile systems. One of these systems is the inter-domain routing infrastructure of the Internet...
Xenofontas A. Dimitropoulos, George F. Riley
CORR
2006
Springer
110views Education» more  CORR 2006»
15 years 6 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
Christophe Cérin, Jean-Christophe Dubacq, J...
GEOINFORMATICA
2006
103views more  GEOINFORMATICA 2006»
15 years 6 months ago
Building and Querying a P2P Virtual World
Peer-to-Peer (P2P) systems are known to provide excellent scalability in a networked environment. One peer is introduced to the system by each participant. However current P2P app...
Egemen Tanin, Aaron Harwood, Hanan Samet, Deepa Na...
IGPL
2006
107views more  IGPL 2006»
15 years 6 months ago
Undecidability over Continuous Time
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...
Jerzy Mycka, José Félix Costa
COMCOM
2007
111views more  COMCOM 2007»
15 years 6 months ago
An argument for simple embedded ACL optimisation
The difficulty of efficiently reordering the rules in an Access Control List is considered and the essential optimisation problem formulated. The complexity of exact and sophistic...
Vic Grout, John Davies, John McGinn