1559 search results - page 195 / 312 » Some Group Theory Problems |
104
click to vote
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
TALG
2010
14 years 4 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
INFOCOM
2006
IEEE
15 years 4 months ago
2006
IEEE
— In reliable multicast, data packets can be cached at some nodes such as repair servers for future possible retransmission in loss recovery schemes. How to cache packets to opti...
ICRA
2003
IEEE
15 years 3 months ago
2003
IEEE
- Moving a crowd of robots or avatars from their current configurations to some destination area without causing collisions is a challenging motion-planning problem because the hig...
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract— Network monitoring and diagnosis are key to improving network performance. The difficulties of performance monitoring lie in today’s fast growing Internet, accompani...