14078 search results - page 2324 / 2816 » Design and Analysis of Computer Algorithms |
209
click to vote
GECCO
2009
Springer
16 years 29 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
182
click to vote
NOSSDAV
2009
Springer
16 years 29 days ago
2009
Springer
This article proposes a new distributed architecture for update message exchange in massively multi-user virtual environments (MMVE). MMVE applications require delivery of updates...
175
click to vote
SIGCOMM
2009
ACM
16 years 28 days ago
2009
ACM
Realizing the full potential of a multi-radio mesh network involves two main challenges: how to assign channels to radios at each node to minimize interference and how to choose h...
168
click to vote
SIGMETRICS
2009
ACM
16 years 28 days ago
2009
ACM
Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Inte...
187
click to vote
SMA
2009
ACM
16 years 28 days ago
2009
ACM
For designing aesthetic surfaces, such as the car bodies, it is very important to use aesthetic curves as characteristic lines. In such curves, the curvature should be monotonical...