Pages that link to "Item:Q4168393"
From MaRDI portal
The following pages link to Progressive global random search of continuous functions (Q4168393):
Displayed 14 items.
- Approximate implementations of pure random search in the presence of noise (Q813364) (← links)
- Random tunneling by means of acceptance-rejection sampling for global optimization (Q1106731) (← links)
- Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
- A decision model and methodology for the AIDS epidemic (Q1200222) (← links)
- Machine learning for optimal blackjack counting strategies (Q1205466) (← links)
- Alternative sampling strategy for a random optimization algorithm (Q1321382) (← links)
- Semiparametric statistical inference in global random search (Q1321573) (← links)
- Global convergence of the stochastic tâtonnement process (Q1587386) (← links)
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering (Q1774572) (← links)
- A global minimization algorithm for Lipschitz functions (Q2465562) (← links)
- Stochastic Methods for Global Optimization (Q3220103) (← links)
- Stochastic global optimization methods part I: Clustering methods (Q3773708) (← links)
- Improvement of pure random search in global optimization (Q4521055) (← links)
- État de l'art des méthodes “d'optimisation globale” (Q4531458) (← links)