9949 search results - page 229 / 1990 » On the Network Complexity of Selection |
155
click to vote
PET
2009
Springer
16 years 1 months ago
2009
Springer
The performance of an anonymous path can be described using many network metrics – e.g., bandwidth, latency, jitter, loss, etc. However, existing relay selection algorithms have ...
173
click to vote
NETGAMES
2005
ACM
16 years 6 days ago
2005
ACM
The increase in power and connectivity of computers has enabled a growth in network games, with many games having numerous servers to which a player can connect. The game server s...
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...
140
click to vote
WSC
1997
15 years 8 months ago
1997
We consider the effect of common random numbers (CRNs) among simulated systems in two different multinomial selection procedures; the classical procedure BEM (Bechhofer, Elmaghr...
189
click to vote
GRAPHICSINTERFACE
2009
15 years 4 months ago
2009
There are a number of challenges associated with content selection in pen-based interfaces. Supplementary buttons to enter a selection mode may not be available, and selections ma...