5170 search results - page 107 / 1034 » Consistency of the FastSLAM Algorithm |
WEA
2009
Springer
15 years 8 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
116
click to vote
ICCSA
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we address the problem of working paths optimization in survivable MPLS network. We focus on an existing facility network, in which only network flows can be optimize...
130
click to vote
ESA
1994
Springer
15 years 5 months ago
1994
Springer
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
115
click to vote
AMC
2006
15 years 1 months ago
2006
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
117
click to vote
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
This paper is concerned with the question of how to online combine an ensemble of active learners so as to expedite the learning progress during a pool-based active learning sessi...