302 search results - page 24 / 61 » Efficient Algorithms for the Longest Path Problem |
126
Voted
IJRR
2002
15 years 2 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...
137
Voted
DCOSS
2007
Springer
15 years 6 months 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 ...
125
Voted
CGO
2003
IEEE
15 years 6 months 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...
123
Voted
ICFP
2008
ACM
16 years 2 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...
123
Voted
JMLR
2010
14 years 9 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 ...