The following pages link to Haldun Aytug (Q168299):
Displayed 20 items.
- Feature selection for support vector machines using generalized Benders decomposition (Q319318) (← links)
- Comparison of imputation methods for discriminant analysis with strategically hidden data (Q323557) (← links)
- Exploring the trade-off between generalization and empirical errors in a one-norm SVM (Q439563) (← links)
- The effect of multiple optima on the simple GA run-time complexity (Q857359) (← links)
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
- (Q958094) (redirect page) (← links)
- Using support vector machines to learn the efficient set in multiple objective discrete optimization (Q958095) (← links)
- Induction over strategic agents: a genetic algorithm solution (Q970177) (← links)
- Induction over constrained strategic agents (Q1046077) (← links)
- A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets (Q1278478) (← links)
- Genetic learning of dynamic scheduling within a simulation environment (Q1342109) (← links)
- Genetic learning through simulation: An investigation in shop floor scheduling (Q1385330) (← links)
- Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study (Q1847206) (← links)
- Executing production schedules in the face of uncertainties: a review and some future directions (Q1887777) (← links)
- Minimizing makespan on a single machine subject to random breakdowns (Q2583704) (← links)
- Risk Minimization and Minimum Description for Linear Discriminant Functions (Q2901014) (← links)
- Detecting Management Fraud in Public Companies (Q3117297) (← links)
- Measures of subproblem criticality in decomposition algorithms for shop scheduling (Q4460042) (← links)
- Stopping Criteria for Finite Length Genetic Algorithms (Q5284227) (← links)
- New stopping criterion for genetic algorithms (Q5928454) (← links)