2924 search results - page 383 / 585 » Lower Bounds in Distributed Computing |
163
click to vote
JMMA
2002
15 years 4 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
167
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
140
click to vote
LCN
2008
IEEE
15 years 11 months ago
2008
IEEE
—End to end available bandwidth is often constrained by IEEE 802.11 hops in the access network. Available bandwidth measurement is particularly challenging in the wireless enviro...
195
click to vote
DAM
2011
14 years 11 months ago
2011
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...
161
click to vote
WIOPT
2011
IEEE
14 years 8 months ago
2011
IEEE
Abstract—In recent years there has been an increasing awareness that the deployment as well as utilization of new information technology may have some negative ecological impact....