14158 search results - page 288 / 2832 » Generalized switch-setting problems |
143
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
136
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
131
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
149
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different evoluti...
KDD
2010
ACM
15 years 6 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...