1933 search results - page 189 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
181
click to vote
COMGEO
2004
ACM
15 years 4 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
174
click to vote
ICDAR
2003
IEEE
15 years 9 months ago
2003
IEEE
Classifying an unknown input is a fundamental problem in pattern recognition. A common method is to define a distance metric between patterns and find the most similar pattern i...
151
click to vote
ICTAI
2010
IEEE
15 years 2 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...
106
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper we present a new nature-inspired variation operator for binary encodings in genetic algorithms (GAs). Our method, called implicit alternative splicing (iAS), is r...
136
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
To help chemists design new drugs, we created a tool that uses interactive evolution to design drug molecules, the “Molecule Evoluator”. In contrast to most other evolutionary...