4679 search results - page 335 / 936 » Modeling When Connections Are the Problem |
195
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
174
click to vote
CIAC
1997
Springer
15 years 11 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
185
click to vote
ECSCW
2007
15 years 8 months ago
2007
Previous work has found that (a) when software is developed collaboratively, concurrent accesses to related pieces of code are made, and (b) when these accesses are coordinated asy...
239
click to vote
AVI
2004
15 years 8 months ago
2004
Understanding complex 3D virtual models can be difficult, especially when the model has interior components not initially visible and ancillary text. We describe new techniques fo...
212
click to vote
ICALP
1998
Springer
15 years 11 months ago
1998
Springer
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...