94 search results - page 8 / 19 » Genericity, Randomness, and Polynomial-Time Approximations |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
EMNLP
2008
13 years 11 months ago
2008
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
ICCD
2003
IEEE
14 years 6 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...