Sciweavers

381 search results - page 59 / 77
» On the advantage over a random assignment
Sort
View
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 8 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
PERCOM
2009
ACM
14 years 8 months ago
Mobile Ad Hoc Networks: the DHT paradigm
In this paper, a DHT-based routing protocol which integrates at the network layer both traditional direct routing, i.e. MANET routing, and indirect key-based routing, i.e. P2P rout...
Marcello Caleffi
P2P
2005
IEEE
106views Communications» more  P2P 2005»
14 years 1 months ago
Chord on Demand
Structured peer-to-peer overlay networks are now an established paradigm for implementing a wide range of distributed services. While the problem of maintaining these networks in ...
Alberto Montresor, Márk Jelasity, Özal...
IWQOS
2005
Springer
14 years 1 months ago
Processor Sharing Flows in the Internet
Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and pr...
Nandita Dukkipati, Masayoshi Kobayashi, Rui Zhang-...
CHI
2007
ACM
13 years 11 months ago
Social responses to virtual humans: implications for future interface design
Do human-human social interactions carry over to humanvirtual human social interactions? How does this affect future interface designers? We replicated classical tests of social i...
Catherine A. Zanbaka, Amy Catherine Ulinski, Paula...