630 search results - page 26 / 126 » Hardness results for approximating the bandwidth |
102
Voted
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
ESANN
2004
15 years 1 months ago
2004
Several reinforcement-learning techniques have already been applied to the Acrobot control problem, using linear function approximators to estimate the value function. In this pape...
114
click to vote
WAOA
2005
Springer
15 years 6 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
112
Voted
SARA
2009
Springer
15 years 7 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
130
Voted
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
In the digital VLSI cycle, logic transformations are often required to modify the design to meet different synthesis and optimization goals. Logic transformations on sequential ci...