Sciweavers

1170 search results - page 106 / 234
» How Fast Is Too Fast
Sort
View
FAST
2011
14 years 6 months ago
Making the Common Case the Only Case with Anticipatory Memory Allocation
We present Anticipatory Memory Allocation (AMA), a new method to build kernel code that is robust to memoryallocation failures. AMA avoids the usual difficulties in handling allo...
Swaminathan Sundararaman, Yupu Zhang, Sriram Subra...
MOBIHOC
2002
ACM
16 years 2 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
GI
1998
Springer
15 years 7 months ago
Self-Organizing Data Mining
"KnowledgeMiner" was designed to support the knowledge extraction process on a highly automated level. Implemented are 3 different GMDH-type self-organizing modeling algo...
Frank Lemke, Johann-Adolf Müller
AISS
2010
114views more  AISS 2010»
15 years 19 days ago
Context Awareness Information Sharing Service based on Location-based Communication Policy
Since more networking technologies and communication channels have been developed, Internet users have moved their roles from being strictly information consumers to both informat...
Yih-Jiun Lee
OSDI
2008
ACM
16 years 3 months ago
Paravirtualized Paging
Conceptually, fast server-side page cache storage could dramatically reduce paging I/O. In this extended abstract, we speculate how such a device might be used, then show how it c...
Daniel J. Magenheimer, Chris Mason, Dave McCracken...