3352 search results - page 203 / 671 » Hierarchical Problem Solving and the Bayesian Optimization A... |
179
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: The traditional (unweighted) k-means is one of the most popular clustering methods for analyzing gene expression data. However, it suffers three major shortcomings. It...
162
click to vote
TALG
2008
15 years 6 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
161
click to vote
ASIAMS
2008
IEEE
16 years 1 months ago
2008
IEEE
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possibl...
178
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
141
Voted
STOC
1999
ACM
15 years 10 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...