3422 search results - page 159 / 685 » Random Subset Optimization |
146
click to vote
ASPDAC
2009
ACM
15 years 11 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
152
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
126
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
135
click to vote
EUROGP
2001
Springer
15 years 9 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
146
click to vote
ICMCS
1998
IEEE
15 years 9 months ago
1998
IEEE
Current video compression formats optimize for either compression or editing. For example, motion-JPEG (MJPEG) provides excellent random access and moderate overall compression, w...