Sciweavers

49 search results - page 8 / 10
» Exact algorithms and applications for Tree-like Weighted Set...
Sort
View
EOR
2007
90views more  EOR 2007»
13 years 7 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
CORR
2011
Springer
161views Education» more  CORR 2011»
13 years 1 months ago
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
Howard J. Karloff, Flip Korn, Konstantin Makaryche...
EVOW
2010
Springer
13 years 6 months ago
Finding Gapped Motifs by a Novel Evolutionary Algorithm
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
Chengwei Lei, Jianhua Ruan
COMPGEOM
2001
ACM
13 years 11 months ago
Discrete mobile centers
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
ICML
2004
IEEE
14 years 25 days ago
Towards tight bounds for rule learning
While there is a lot of empirical evidence showing that traditional rule learning approaches work well in practice, it is nearly impossible to derive analytical results about thei...
Ulrich Rückert, Stefan Kramer