96 search results - page 4 / 20 » Combining Two Local Search Approaches to Hypergraph Partitio... |
ANOR
2010
14 years 9 months ago
2010
We consider the linear classification method consisting of separating two sets of points in d-space by a hyperplane. We wish to determine the hyperplane which minimises the sum of...
BMCBI
2008
14 years 9 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
APWEB
2003
Springer
15 years 2 months ago
2003
Springer
Search engines are among the most important applications or services on the web. Most existing successful search engines use global ranking algorithms to generate the ranking of do...
EVOW
2007
Springer
15 years 1 months ago
2007
Springer
In this paper we introduce an hybrid evolutionary algorithm for computer-aided orchestration. Our current approach to orchestration consists in replicating a target sound with a se...
195
click to vote
GECCO
2011
Springer
14 years 1 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...