3678 search results - page 277 / 736 » On the Stable Paths Problem |
163
click to vote
COR
2006
15 years 6 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
191
Voted
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
Illumination variation has been one of the most intractable problems in face recognition and many approaches have been proposed to handle illumination problem in the last decades ...
152
Voted
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in t...
170
Voted
GD
2006
Springer
15 years 10 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
187
click to vote
ICRA
1995
IEEE
15 years 10 months ago
1995
IEEE
The optimal motion generation problem is solved subject to various actuator constraints while the motion is constrained to an arbitrary path. The considered objective function is ...