1326 search results - page 162 / 266 » Approximate Tree Kernels |
110
click to vote
ALENEX
2001
15 years 3 months ago
2001
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...
99
Voted
ESA
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
140
Voted
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
135
click to vote
RECOMB
2000
Springer
15 years 6 months ago
2000
Springer
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
142
click to vote
WCE
2007
15 years 3 months ago
2007
—Multistage stochastic programs are effective for solving long-term planning problems under uncertainty. Such programs are usually based on scenario generation model about future...