1046 search results - page 127 / 210 » Approximation Algorithms for Domination Search |
230
click to vote
IJON
2006
15 years 7 months ago
2006
This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its applicati...
205
click to vote
ICTAI
2010
IEEE
15 years 5 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
158
click to vote
IWINAC
2007
Springer
16 years 1 months ago
2007
Springer
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
184
Voted
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
This paper presents a novel approach for a free structure analog circuit design using Genetic Algorithms (GA). A major problem in a free structure circuit is its sensitivity calcu...
213
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...