1729 search results - page 208 / 346 » On Bounds for the k-Partitioning of Graphs |
171
click to vote
APN
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
195
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
150
click to vote
AAAI
2006
15 years 7 months ago
2006
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
172
click to vote
IJRR
2006
15 years 6 months ago
2006
In this paper we study the time evolution of the position estimates' covariance in Cooperative Simultaneous Localization and Mapping (C-SLAM), and obtain analytical upper boun...
209
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...