302 search results - page 24 / 61 » Efficient Algorithms for the Longest Path Problem |
IJRR
2002
13 years 8 months ago
2002
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...
DCOSS
2007
Springer
14 years 16 days ago
2007
Springer
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor ...
CGO
2003
IEEE
14 years 7 days ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
ICFP
2008
ACM
14 years 8 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
JMLR
2010
13 years 3 months ago
2010
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...