350 search results - page 8 / 70 » Lower bounds and heuristic algorithms for the k |
114
click to vote
ISSS
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
CPAIOR
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
COR
2008
14 years 11 months ago
2008
An approach is proposed for generating homogenous three-staged cutting patterns for the constrained two-dimensional guillotinecutting problems of rectangles. It is based on branch...
IBERAMIA
2004
Springer
15 years 5 months ago
2004
Springer
We present a new branch and bound algorithm for Max-SAT which incorporates original lazy data structures, a new variable selection heuristics and a lower bound of better quality. W...