2657 search results - page 244 / 532 » On the complexity of hierarchical problem solving |
SIGACT
2010
15 years 11 days ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
135
click to vote
SWAT
2010
Springer
14 years 12 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
105
click to vote
ICASSP
2009
IEEE
14 years 11 months ago
2009
IEEE
In this paper, we show that the problem of detection and localization of multiple targets in a bistatic MIMO radar system can be solved by Parallel Factor (PARAFAC) analysis. Our ...
126
click to vote
TC
2010
14 years 8 months ago
2010
Continued logarithms, as originally introduced by Gosper, represent a means for exact rational arithmetic, but their application to exact real arithmetic is limited by the uniquene...
103
click to vote
ECLIPSE
2006
ACM
15 years 8 months ago
2006
ACM
Refactoring tools allow programmers to change source code much quicker than before. However, the complexity of these changes cause versioning tools that operate at a file level t...