Sciweavers

2479 search results - page 69 / 496
» A Computational Theory of Working Memory
Sort
View
MOBIHOC
2009
ACM
14 years 8 months ago
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
Han Cai, Do Young Eun
CCECE
2006
IEEE
14 years 1 months ago
A Dynamic Associative E-Learning Model based on a Spreading Activation Network
Presenting information to an e-learning environment is a challenge, mostly, because ofthe hypertextlhypermedia nature and the richness ofthe context and information provides. This...
Phongchai Nilas, Nilamit Nilas, Somsak Mitatha
ICS
2003
Tsinghua U.
14 years 27 days ago
miNI: reducing network interface memory requirements with dynamic handle lookup
Recent work in low-latency, high-bandwidth communication systems has resulted in building user–level Network InControllers (NICs) and communication abstractions that support dir...
Reza Azimi, Angelos Bilas
HPCC
2005
Springer
14 years 1 months ago
Reducing Memory Sharing Overheads in Distributed JVMs
Distributed JVM systems enable concurrent Java applications to transparently run on clusters of commodity computers by supporting Java’s shared-memory model over multiple JVMs di...
Marcelo Lobosco, Orlando Loques, Claudio Luis de A...
ALGORITHMICA
2002
104views more  ALGORITHMICA 2002»
13 years 7 months ago
Security of Quantum Key Distribution against All Collective Attacks
Security of quantum key distribution against sophisticated attacks is among the most important issues in quantum information theory. In this work we prove security against a very ...
Eli Biham, Michel Boyer, Gilles Brassard, Jeroen v...