The following pages link to Gary J. Koehler (Q168300):
Displaying 44 items.
- A hybrid method for quantum global optimization (Q427367) (← links)
- The mixed postman problem (Q754753) (← links)
- A general steady state distribution based stopping criteria for finite length genetic algorithms (Q853021) (← links)
- The effect of multiple optima on the simple GA run-time complexity (Q857359) (← links)
- A location-allocation problem for a web services provider in a competitive market (Q953425) (← links)
- Induction over strategic agents: a genetic algorithm solution (Q970177) (← links)
- Using modifications to Grover's search algorithm for quantum global optimization (Q992656) (← links)
- Induction over constrained strategic agents (Q1046077) (← links)
- PAC-learning a decision tree with pruning (Q1278327) (← links)
- A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets (Q1278478) (← links)
- An investigation on the conditions of pruning an induced decision tree (Q1333477) (← links)
- Genetic learning of dynamic scheduling within a simulation environment (Q1342109) (← links)
- New directions in genetic algorithm theory (Q1379730) (← links)
- Genetic learning through simulation: An investigation in shop floor scheduling (Q1385330) (← links)
- Pricing combinatorial auctions. (Q1420433) (← links)
- A proof of the Vose-Liepins conjecture (Q1924790) (← links)
- On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch (Q2427178) (← links)
- Learning genetic algorithm parameters using hidden Markov models (Q2433443) (← links)
- Improper linear discriminant classifiers (Q2640283) (← links)
- An evolutionary approach to group decision making (Q2884537) (← links)
- A heuristic for winner determination in rule-based combinatorial auctions (Q2892265) (← links)
- Conditions that obviate the no-free-lunch theorems for optimization (Q2892335) (← links)
- Minimal equivalent binary knapsack inequalities (Q2899135) (← links)
- Risk minimization and minimum description for linear discriminant functions (Q2901014) (← links)
- Value Convergence in a Generalized Markov Decision Process (Q3048618) (← links)
- A complementarity approach for solving Leontief substitution systems and (generalized) Markov decision processes (Q3048619) (← links)
- A Market-Based Optimization Algorithm for Distributed Systems (Q3116136) (← links)
- Detecting Management Fraud in Public Companies (Q3117297) (← links)
- Relationships Between Various Markovian Decision Problem Classes (Q3204347) (← links)
- Technical Note—A Look at Finding Points of a Convex Polyhedron Using Relaxation and Subgradient Procedures (Q3863691) (← links)
- Note—Sensitivity Analysis in Leontief Substitution Systems (Q3895245) (← links)
- Bounds and elimination in generalized markov decisions (Q3901335) (← links)
- A generalized Markov decision process (Q3926376) (← links)
- On Optimal Allocation in a Distributed Processing Environment (Q3948871) (← links)
- Computation techniques for large scale undiscounted markov decision processes (Q3962809) (← links)
- Linear Discriminant Functions Determined by Genetic Search (Q4015419) (← links)
- An iterative procedure for nondiscounted discrete-time markov decisions (Q4048863) (← links)
- (Q4077718) (← links)
- The Solution of Leontief Substitution Systems using Matrix Iterative Techniques (Q4135218) (← links)
- Note—A Comment on Rao's Class ℳ and <i>S̄</i> Matrices (Q4136926) (← links)
- (Q4404680) (← links)
- (Q4834456) (← links)
- Stopping Criteria for Finite Length Genetic Algorithms (Q5284227) (← links)
- New stopping criterion for genetic algorithms (Q5928454) (← links)
