Sciweavers

6562 search results - page 227 / 1313
» Noetherianity and Combination Problems
Sort
View
EOR
2006
80views more  EOR 2006»
15 years 6 months ago
Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post
This paper presents a new multi-depot combined vehicle and crew scheduling algorithm, and uses it, in conjunction with a heuristic vehicle routing algorithm, to solve the intra-ci...
B. L. Hollis, M. A. Forbes, B. E. Douglas
CVPR
2010
IEEE
15 years 4 months ago
Visual classification with multi-task joint sparse representation
We address the problem of computing joint sparse representation of visual signal across multiple kernel-based representations. Such a problem arises naturally in supervised visual...
Xiaotong Yuan, Shuicheng Yan
RECOMB
2005
Springer
16 years 6 months ago
Reversals of Fortune
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...
David Sankoff, Chunfang Zheng, Aleksander Lenert
ICRA
2008
IEEE
117views Robotics» more  ICRA 2008»
16 years 1 months ago
Tracking hidden agents through shadow information spaces
— This paper addresses problems of inferring the locations of moving agents from combinatorial data extracted by robots that carry sensors. The agents move unpredictably and may ...
Jingjin Yu, Steven M. LaValle
CEC
2007
IEEE
16 years 27 days ago
On improving approximate solutions by evolutionary algorithms
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank ...