Sciweavers

1814 search results - page 123 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
174
Voted
COR
2007
163views more  COR 2007»
15 years 6 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
BMCBI
2007
124views more  BMCBI 2007»
15 years 6 months ago
BranchClust: a phylogenetic algorithm for selecting gene families
Background: Automated methods for assembling families of orthologous genes include those based on sequence similarity scores and those based on phylogenetic approaches. The first ...
Maria S. Poptsova, J. Peter Gogarten
AAAI
2012
13 years 8 months ago
Transfer Learning with Graph Co-Regularization
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
Mingsheng Long, Jianmin Wang 0001, Guiguang Ding, ...
ICRA
2005
IEEE
132views Robotics» more  ICRA 2005»
15 years 11 months ago
Handling the Inconsistency of Relative Map Filter
— In [5], a version of Relative Map Filter (RMF) is proposed to solve the simultaneous localization and map building (SLAM) problem. In the RMF, the map states contain only quant...
Viet Nguyen, Agostino Martinelli, Roland Siegwart
MP
2006
138views more  MP 2006»
15 years 6 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...