335 search results - page 44 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
157
click to vote
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
148
Voted
AAAI
1998
15 years 4 months ago
1998
One of the most important problems for an intelligent tutoring system is deciding how to respond when a student asks for help. Responding cooperatively requires an understanding o...
153
click to vote
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— In this paper we address the problem of visual motion estimation (visual odometry) from a single vehicle mounted camera. One of the basic issues of visual odometry is relative ...
145
Voted
SPC
2005
Springer
15 years 9 months ago
2005
Springer
As Global Positioning System (GPS) receivers become a common feature in cell phones, personal digital assistants, and automobiles, there is a growing interest in tracking larger us...
108
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...