4110 search results - page 87 / 822 » Efficient algorithms for the 2-gathering problem |
128
click to vote
ISCAS
2006
IEEE
15 years 10 months ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
142
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
150
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
114
Voted
IJCAI
1989
15 years 5 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
122
click to vote
IJPP
2008
15 years 4 months ago
2008
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters with tree topologies. Using our scheme for clusters with cut-through switches, an...