1816 search results - page 72 / 364 » A New Approach for Solving the Maximum Clique Problem |
158
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Auction methods have been successfully used for coordinating teams of robots in the multi-robot routing problem, a representative domain for multi-agent coordination. Solutions to...
156
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
154
click to vote
IJON
2000
2000
Synthesis approach for bidirectional associative memories based on the perceptron training algorithm
15 years 5 months ago
Bidirectional associative memories are being used extensively for solving a variety of problems related to pattern recognition. In the present paper, a new synthesis approach is d...
169
click to vote
ECCV
1998
Springer
16 years 7 months ago
1998
Springer
Assume that some objects are present in an image but can be seen only partially and are overlapping each other. To recognize the objects, we have to rstly separate the objects from...
202
click to vote
EMMCVPR
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. We propose a vector representation approach to contour estimation from noisy data. Images are modeled as random elds composed of a set of homogeneous regions contours (bo...