3049 search results - page 294 / 610 » On the Convergence of Bound Optimization Algorithms |
147
Voted
ICALP
2005
Springer
16 years 4 days 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...
186
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
171
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
Abstract -- This paper presents a novel, Boolean approach to LUTbased FPGA technology mapping targeting high performance. As the core of the approach, we have developed a powerful ...
156
click to vote
COCOON
2007
Springer
16 years 24 days ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
151
click to vote
MP
1998
15 years 6 months ago
1998
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...