Sciweavers

489 search results - page 82 / 98
» Computing robust basestock levels
Sort
View
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
IMC
2006
ACM
14 years 1 months ago
Rarest first and choke algorithms are enough
The performance of peer-to-peer file replication comes from its piece and peer selection strategies. Two such strategies have been introduced by the BitTorrent protocol: the rare...
Arnaud Legout, Guillaume Urvoy-Keller, Pietro Mich...
ISRR
2005
Springer
154views Robotics» more  ISRR 2005»
14 years 1 months ago
Session Overview Planning
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...
Nicholas Roy, Roland Siegwart
FOCS
2002
IEEE
14 years 18 days ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
GI
2009
Springer
14 years 7 days ago
Barcode Application Innovation for Smartphones
: Modern smartphones provide a high sophisticated camera and a high resolution display. Therefore, they can be used to enable various application scenarios for 1D and 2D barcode re...
Gerald Eichler, Karl-Heinz Lüke, Aykan Aydin,...