Sciweavers

692 search results - page 35 / 139
» Some research questions for computational transportation sci...
Sort
View
CN
2007
89views more  CN 2007»
13 years 8 months ago
Determining an appropriate sending rate over an underutilized network path
Determining an appropriate sending rate when beginning data transmission into a network with unknown characteristics is a fundamental issue in best-effort networks. Traditionally,...
Pasi Sarolahti, Mark Allman, Sally Floyd
GI
2004
Springer
14 years 1 months ago
On the Use of Structured P2P Indexing Mechanisms in Mobile Ad-Hoc Scenarios
Abstract: Recently, Distributed Hash Tables evolved to a preferred approach for decentralized data management in widely distributed systems. Due to their crucial characteristics â€...
Tobias Heer, Heiko Niedermayer, Leo Petrak, Simon ...
SOFSEM
2012
Springer
12 years 4 months ago
Iterated Hairpin Completions of Non-crossing Words
Abstract. Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or m...
Lila Kari, Steffen Kopecki, Shinnosuke Seki

Publication
1322views
15 years 6 months ago
Congestion Control in Computer Networks: Issues and Trends
Popular myths that cheaper memory, high-speed links and high-speed processors will solve the problem of congestion in computer networks are shown to be false. A simple definition f...
R. Jain
SUTC
2006
IEEE
14 years 2 months ago
The Computational Complexity of Enforceability Validation for Generic Access Control Rules
In computer security, many researches have tackled on the possibility of a unified model of access control, which could enforce any access control policies within a single unified...
Vincent C. Hu, D. Richard Kuhn, David F. Ferraiolo