2137 search results - page 148 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
132
click to vote
AIEDAM
2007
15 years 6 months ago
2007
Achieving the dimensional integrity for a complex structural assembly is a demanding task due to the manufacturing variations of parts and the tolerance relationship between them....
181
Voted
AAIM
2006
Springer
16 years 4 days ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
121
click to vote
KDD
2010
ACM
15 years 8 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...
176
Voted
CCE
2004
15 years 6 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
136
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...