Sciweavers

288 search results - page 45 / 58
» Recent progress in quantum algorithms
Sort
View
ICCAD
2003
IEEE
109views Hardware» more  ICCAD 2003»
14 years 5 months ago
Large-Scale Circuit Placement: Gap and Promise
Placement is one of the most important steps in the RTLto-GDSII synthesis process, as it directly defines the interconnects, which have become the bottleneck in circuit and syste...
Jason Cong, Tim Kong, Joseph R. Shinnerl, Min Xie,...
BMCBI
2004
122views more  BMCBI 2004»
13 years 8 months ago
A comprehensive comparison of comparative RNA structure prediction approaches
Background: An increasing number of researchers have released novel RNA structure analysis and prediction algorithms for comparative approaches to structure prediction. Yet, indep...
Paul P. Gardner, Robert Giegerich
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 3 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
11 years 11 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
FOCS
2006
IEEE
14 years 2 months ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng