2244 search results - page 62 / 449 » A new heuristic approach for non-convex optimization problem... |
169
click to vote
MMM
2009
Springer
16 years 28 days ago
2009
Springer
In this paper, we present a novel multiple kernel method to learn the optimal classification function for visual concept. Although many carefully designed kernels have been propose...
132
click to vote
CSB
2004
IEEE
15 years 10 months ago
2004
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
149
click to vote
CEC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract-- In many real-world scenarios, in contrast to standard benchmark optimization problems, we may face some uncertainties regarding the objective function. One source of the...
152
click to vote
CIBCB
2005
IEEE
15 years 11 months ago
2005
IEEE
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
161
click to vote
BROADNETS
2005
IEEE
15 years 11 months ago
2005
IEEE
— Due to varying wireless channel conditions, the IEEE 802.11 wireless local area network (WLAN) standard supports multiple modulation types to accommodate the tradeoff between d...