154 search results - page 22 / 31 » Routing for Relief Efforts |
DAC
2002
ACM
14 years 8 months ago
2002
ACM
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
MSWIM
2004
ACM
14 years 29 days ago
2004
ACM
Emerging “urban” ad hoc networks resulting from a large number of individual WLAN users challenge the way users could explore and interact with their physical surroundings. Ro...
MOBICOM
2003
ACM
14 years 24 days ago
2003
ACM
The characteristics of ad hoc networks naturally encourage the deployment of distributed services. Although current networks implement group communication methods, they do not sup...
GLOBECOM
2008
IEEE
13 years 8 months ago
2008
IEEE
— Recently, establishing a VoIP call using a P2P network instead of regular SIP-servers has been proposed; this novel approach to SIP-signaling is commonly referred to as P2PSIP ...
CHI
2002
ACM
14 years 8 months ago
2002
ACM
Scheduling, routing, and layout tasks are examples of hardamount of computational effort expended on different subproblems. CHI?2002 This work may not be copied or reproduced in w...