500 search results - page 24 / 100 » A Sample Approximation Approach for Optimization with Probab... |
STOC
2006
ACM
14 years 8 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
AGILEDC
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper documents a successful implementation of agile at a major telecommunications firm. Critical aspects to mention about this particular software endeavor include a) this c...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
IJCAI
2003
13 years 9 months ago
2003
An agent with limited consumable execution resources needs policies that attempt to achieve good performance while respecting these limitations. Otherwise, an agent (such as a pla...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
When sampling signals below the Nyquist rate, efficient and accurate reconstruction is nevertheless possible, whenever the sampling system is well behaved and the signal is well ...