840 search results - page 43 / 168 » Inapproximability of Combinatorial Optimization Problems |
131
Voted
STOC
2010
ACM
15 years 6 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
129
click to vote
WINE
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we extend the notion of multi-unit combinatorial reverse auction by adding a new dimension to the goods at auction. In such a new type of combinatorial auction a buye...
151
Voted
EVOW
2012
Springer
13 years 10 months ago
2012
Springer
Abstract. The hydrophobic-polar (HP) model for protein structure preabstracts the fact that hydrophobic interactions are a dominant force in the protein folding process. This model...
105
Voted
GLVLSI
1998
IEEE
15 years 6 months ago
1998
IEEE
In this paper we address the problem of optimizing mixed CMOS BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an ta...
96
Voted
AAAI
2008
15 years 4 months ago
2008
Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important....