630 search results - page 35 / 126 » Hardness results for approximating the bandwidth |
112
click to vote
CHI
1997
ACM
15 years 4 months ago
1997
ACM
Recent work in computer input control has sought to maximize the use of the fingers in the operation of computer pointing devices. The main rationale is the hypothesis that the m...
129
Voted
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
In this paper we present the use of a previously developed single-objective optimization approach, together with the -constraint method, to provide an approximation of the Pareto ...
117
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
135
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
128
Voted
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...