3678 search results - page 230 / 736 » On the Stable Paths Problem |
132
click to vote
MVA
1998
15 years 6 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
113
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
141
Voted
ESCIENCE
2007
IEEE
15 years 9 months ago
2007
IEEE
Increasing the efficiency of meander line antennas is an important real-world problem within radio frequency identification (RFID). Meta-heuristic search algorithms, such as ant c...
143
Voted
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
The prediction of the native structures of proteins, the socalled protein folding problem, is a NP hard multi-minima optimization problem for which to date no routine solutions ex...
153
click to vote
TAMC
2009
Springer
15 years 11 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...