2168 search results - page 202 / 434 » Randomized Algorithms and Complexity Theory |
109
Voted
SIGMETRICS
2002
ACM
15 years 3 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
154
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
117
Voted
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— Trust management, broadly intended as the ability to maintain belief relationship among entities, is recognized as a fundamental security challenge for autonomous and selforgan...
124
Voted
WINET
2002
15 years 3 months ago
2002
We present a game-theoretic treatment of distributed power control in CDMA wireless systems. We make use of the conceptual framework of noncooperative game theory to obtain a distr...
147
Voted
TCOM
2008
15 years 3 months ago
2008
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...