2446 search results - page 184 / 490 » Choiceless Polynomial Time |
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— Coverage is a fundamental problem in sensor networks. In this paper, we addressed the coverage problem from two different view points and refer to them as the worst and...