Sciweavers

14 search results - page 3 / 3
» Comparison of Instances Seletion Algorithms I. Algorithms Su...
Sort
View
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
13 years 11 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
KDD
2006
ACM
191views Data Mining» more  KDD 2006»
14 years 6 months ago
Beyond classification and ranking: constrained optimization of the ROI
Classification has been commonly used in many data mining projects in the financial service industry. For instance, to predict collectability of accounts receivable, a binary clas...
Lian Yan, Patrick Baldasare
ESA
2007
Springer
176views Algorithms» more  ESA 2007»
14 years 12 days ago
Arrangements in Geometry: Recent Advances and Challenges
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
Micha Sharir
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 6 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite