Sciweavers

1182 search results - page 64 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
ECML
2006
Springer
15 years 5 months ago
An Adaptive Kernel Method for Semi-supervised Clustering
Semi-supervised clustering uses the limited background knowledge to aid unsupervised clustering algorithms. Recently, a kernel method for semi-supervised clustering has been introd...
Bojun Yan, Carlotta Domeniconi
133
Voted
INFOCOM
2011
IEEE
14 years 5 months ago
Consort: Node-Constrained Opportunistic Routing in wireless mesh networks
— Opportunistic routing is proposed to improve the performance of wireless networks by exploiting the broadcast nature and spatial diversity of the wireless medium. In this paper...
Xi Fang, Dejun Yang, Guoliang Xue
ISDA
2008
IEEE
15 years 8 months ago
Cultural-Based Genetic Algorithm: Design and Real World Applications
Due to their excellent performance in solving combinatorial optimization problems, metaheuristics algorithms such as Genetic Algorithms (GA), Simulated Annealing (SA) and Tabu Sea...
Mostafa A. El-Hosseini, Aboul Ella Hassanien, Ajit...
ICANN
2003
Springer
15 years 7 months ago
Optimizing Property Codes in Protein Data Reveals Structural Characteristics
We search for assignments of numbers to the amino acids (property codes) that maximize the autocorrelation function signal in given protein sequence data by an iterative method. Ou...
Olaf Weiss, Andreas Ziehe, Hanspeter Herzel
ICML
2009
IEEE
15 years 8 months ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...