16404 search results - page 265 / 3281 » A set coverage problem |
154
click to vote
DAC
1989
ACM
15 years 8 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
142
click to vote
CVGIP
2000
15 years 4 months ago
2000
In this paper we present a hierarchical approach for the deformable surface technique. This technique is a three dimensional extension of the snake segmentation method. We use it ...
122
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we describe the use of an evolutionary algorithm (EA) to solve dynamic control optimization problems in engineering. In this class of problems, a set of control var...
130
click to vote
BIRTHDAY
1997
Springer
15 years 8 months ago
1997
Springer
This article describes a parallel and distributed machine learning approach to a basic variant of the job assignment problem. The approach is in the line of the multiagent learning...
126
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at m...