Sciweavers

154 search results - page 19 / 31
» Routing for Relief Efforts
Sort
View
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
14 years 2 months ago
Priority based forced requeue to reduce worst-case latencies for bursty traffic
- In this paper we introduce Priority Based Forced Requeue to decrease worst-case latencies in NoCs offering best effort services. Forced Requeue is to prematurely lift out low pri...
Mikael Millberg, Axel Jantsch
C5
2009
IEEE
14 years 8 days ago
The PresenceDetector: Context Awareness for Collaboration
In this paper we introduce a concept of how the status of project partners in a virtual collaboration environment can be transferred in a subtle manner to gain useful information ...
Moritz Kemper, Constanze Langer, Christine Strotho...
COLING
1992
13 years 8 months ago
Planning To Fail, Not Failing To Plan: Risk-Taking And Recovery In Task-Oriented Dialogue
duplicate the route. The HCRC Dialogue Database [3] We hypothesise that agents who engage in task- contains 128 such dialogues; in this work we examined oriented dialogue usually t...
Jean Carletta
SIGMOD
2007
ACM
150views Database» more  SIGMOD 2007»
14 years 7 months ago
System design issues in sensor databases
In-network sensor query processing systems (ISQPs), or sensor databases, have been developed to acquire, process and aggregate data from wireless sensor networks (WSNs). Because W...
Qiong Luo, Hejun Wu
INFOSCALE
2006
ACM
14 years 1 months ago
Exploiting P2P systems for DDoS attacks
— When a P2P system has millions of concurrently active peers, there is the risk that it could serve as a DDoS engine for attacks against a targeted host. In this paper we descri...
Naoum Naoumov, Keith W. Ross