3894 search results - page 394 / 779 » Approximation Algorithms for Biclustering Problems |
153
click to vote
IJCSA
2007
15 years 4 months ago
2007
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
138
click to vote
SECON
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
171
Voted
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
180
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
140
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...