4860 search results - page 390 / 972 » SNPs Problems, Complexity, and Algorithms |
103
Voted
STOC
2010
ACM
16 years 1 months ago
2010
ACM
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
157
Voted
ATAL
2010
Springer
15 years 4 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...
122
click to vote
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
We propose a novel distortion minimization technique for the transmission of a packetized progressive bitstream. We consider tandem channels introducing bit errors and packet eras...
133
Voted
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
—As more and more real-world optimization problems become increasingly complex, algorithms with more capable optimizations are also increasing in demand. For solving large scale ...
107
Voted
SIGECOM
2005
ACM
15 years 9 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...