879 search results - page 20 / 176 » Designing Closer to the Edge |
CIT
2004
Springer
14 years 3 months ago
2004
Springer
End-to-end congestion control algorithms in TCP are designed for a highly co-operative environment with the assumption that the end hosts voluntarily participate in it and obey th...
ESA
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
DPPI
2007
ACM
14 years 1 months ago
2007
ACM
This paper documents a first attempt at "designing for the self", an approach to designing products intended to help people move closer to their idealized sense of self a...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...
GD
2001
Springer
14 years 2 months ago
2001
Springer
This paper studies the problem of computing an orthogonal drawing of a graph with labels along the edges. Labels are not allowed to overlap with each other or with edges to which t...