Sciweavers

2211 search results - page 396 / 443
» The state of peer-to-peer simulators and simulations
Sort
View
SIROCCO
2007
14 years 11 months ago
Fast Periodic Graph Exploration with Constant Memory
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
Leszek Gasieniec, Ralf Klasing, Russell A. Martin,...
AAAI
2004
14 years 11 months ago
SCoT: A Spoken Conversational Tutor
We describe SCoT, a Spoken Conversational Tutor, which has been implemented in order to investigate the advantages of natural language in tutoring, especially spoken language. SCo...
Karl Schultz, Brady Clark, Heather Pon-Barry, Eliz...
NSDI
2004
14 years 11 months ago
Efficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
ATAL
2010
Springer
14 years 10 months ago
A probabilistic model for trust and reputation
This paper concerns the problem of agent trust in an electronic market place. We maintain that agent trust involves making decisions under uncertainty and therefore the phenomenon...
George Vogiatzis, Ian MacGillivray, Maria Chli
SIGCOMM
2010
ACM
14 years 10 months ago
NetFence: preventing internet denial of service from inside out
Denial of Service (DoS) attacks frequently happen on the Internet, paralyzing Internet services and causing millions of dollars of financial loss. This work presents NetFence, a s...
Xin Liu, Xiaowei Yang, Yong Xia