Sciweavers

16404 search results - page 859 / 3281
» A set coverage problem
Sort
View
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
15 years 11 months ago
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
Khaled M. Elbassioni, René Sitters, Yan Zha...
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
15 years 9 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
NIPS
2008
15 years 9 months ago
Robust Regression and Lasso
We consider robust least-squares regression with feature-wise disturbance. We show that this formulation leads to tractable convex optimization problems, and we exhibit a particul...
Huan Xu, Constantine Caramanis, Shie Mannor
IJCAI
1989
15 years 8 months ago
Training Feedforward Neural Networks Using Genetic Algorithms
Multilayered feedforward neural networks possess a number of properties which make them particularly suited to complex pattern classification problems. However, their application ...
David J. Montana, Lawrence Davis
AUTOMATICA
2008
116views more  AUTOMATICA 2008»
15 years 7 months ago
A dynamical systems approach to weighted graph matching
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
Michael M. Zavlanos, George J. Pappas