Sciweavers

3250 search results - page 281 / 650
» An Algorithm to Solve a Linear Program
Sort
View
GECCO
2005
Springer
100views Optimization» more  GECCO 2005»
16 years 4 days ago
Evolutionary tree genetic programming
We introduce a clustering-based method of subpopulation management in genetic programming (GP) called Evolutionary Tree Genetic Programming (ETGP). The biological motivation behin...
Ján Antolík, William H. Hsu
GECCO
2005
Springer
151views Optimization» more  GECCO 2005»
16 years 4 days ago
Backward-chaining genetic programming
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
Riccardo Poli, William B. Langdon
KDD
2008
ACM
134views Data Mining» more  KDD 2008»
16 years 7 months ago
Privacy-preserving cox regression for survival analysis
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
Shipeng Yu, Glenn Fung, Rómer Rosales, Srir...
JMLR
2008
150views more  JMLR 2008»
15 years 6 months ago
Discriminative Learning of Max-Sum Classifiers
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and obser...
Vojtech Franc, Bogdan Savchynskyy
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
16 years 1 months ago
Path Feasibility Analysis for String-Manipulating Programs
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
Nikolaj Bjørner, Nikolai Tillmann, Andrei V...