Sciweavers

400 search results - page 43 / 80
» Extended formulations in combinatorial optimization
Sort
View
ICML
2009
IEEE
16 years 17 days ago
More generality in efficient multiple kernel learning
Recent advances in Multiple Kernel Learning (MKL) have positioned it as an attractive tool for tackling many supervised learning tasks. The development of efficient gradient desce...
Manik Varma, Bodla Rakesh Babu
TSMC
2008
99views more  TSMC 2008»
14 years 11 months ago
Robust Regularized Kernel Regression
Robust regression techniques are critical to fitting data with noise in real-world applications. Most previous work of robust kernel regression is usually formulated into a dual fo...
Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
15 years 5 months ago
A genetic algorithm for unmanned aerial vehicle routing
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
Matthew A. Russell, Gary B. Lamont
76
Voted
ICDM
2005
IEEE
146views Data Mining» more  ICDM 2005»
15 years 5 months ago
Merging Interface Schemas on the Deep Web via Clustering Aggregation
We consider the problem of integrating a large number of interface schemas over the Deep Web, The scale of the problem and the diversity of the sources present serious challenges ...
Wensheng Wu, AnHai Doan, Clement T. Yu
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
15 years 9 months ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen