Pages that link to "Item:Q2485925"

The following pages link to A tutorial on the cross-entropy method (Q2485925):

Displaying 50 items.

• Oblique decision tree induction by cross-entropy optimization based on the von Mises-Fisher distribution (Q2095749) (← links)
• Measurements of quantum Hamiltonians with locally-biased classical shadows (Q2124207) (← links)
• A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
• Fast rates of minimum error entropy with heavy-tailed noise (Q2168008) (← links)
• An adaptive metamodel-based subset importance sampling approach for the assessment of the functional failure probability of a thermal-hydraulic passive system (Q2293863) (← links)
• Segmentation of brain MR images by using fully convolutional network and Gaussian mixture model with spatial constraints (Q2298452) (← links)
• Measuring the asymmetric contributions of individual subsystems (Q2353777) (← links)
• A cross entropy algorithm for the Knapsack problem with setups (Q2384601) (← links)
• Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems (Q2413317) (← links)
• Multifidelity importance sampling (Q2414635) (← links)
• Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (Q2422923) (← links)
• How many needles are in a haystack, or how to solve \#P-complete counting problems fast (Q2433252) (← links)
• Convergence properties of the cross-entropy method for discrete optimization (Q2465943) (← links)
• Rare-event simulation of non-Markovian queueing networks using a state-dependent change of measure determined using cross-entropy (Q2485926) (← links)
• The cross-entropy method for network reliability estimation (Q2485928) (← links)
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method (Q2485932) (← links)
• On the convergence of the cross-entropy method (Q2485934) (← links)
• Basis function adaptation in temporal difference reinforcement learning (Q2485935) (← links)
• A stochastic minimum cross-entropy method for combinatorial optimization and rare-event estimation (Q2487758) (← links)
• Cross-entropy loss for recommending efficient fold-over technique (Q2661887) (← links)
• DAS-PINNs: a deep adaptive sampling method for solving high-dimensional partial differential equations (Q2681099) (← links)
• Single-index importance sampling with stratification (Q2684956) (← links)
• CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
• Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
• Combinatorial optimization, cross-entropy, ants and rare events (Q2752041) (← links)
• Parameter estimation and optimal scheduling algorithm for a mathematical model of intermittent androgen suppression therapy for prostate cancer (Q2787900) (← links)
• An overview of population-based algorithms for multi-objective optimisation (Q2792889) (← links)
• Adapted cross entropy method to investigate costly price-changes in pricing and production planning (Q2813616) (← links)
• The Normalized Autocorrelation Length of Random Max  $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ (Q2818001) (← links)
• Approximate policy iteration: a survey and some new methods (Q2887629) (← links)
• The Robust Constant and Its Applications in Global Optimization (Q2942507) (← links)
• Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO (Q2950522) (← links)
• Action selection in growing state spaces: control of network structure growth (Q2959722) (← links)
• Minimizing sidelobe levels and facilitating null placements of nonlinear antenna arrays using an improved particle swarm optimization method (Q2970653) (← links)
• Transport Map Accelerated Markov Chain Monte Carlo (Q3176240) (← links)
• Multifidelity Preconditioning of the Cross-Entropy Method for Rare Event Simulation and Failure Probability Estimation (Q3176243) (← links)
• Optimal Path Planning for Information Based Localization (Q3192971) (← links)
• Inferring Obstacles and Path Validity from Visibility-Constrained Demonstrations (Q3381948) (← links)
• Learning Tetris Using the Noisy Cross-Entropy Method (Q3421374) (← links)
• Entropy and Cross Entropy: Characterizations and Applications (Q3449748) (← links)
• HEAVY TAILS, IMPORTANCE SAMPLING AND CROSS–ENTROPY (Q4678851) (← links)
• Selecting Reduced Models in the Cross-Entropy Method (Q4960999) (← links)
• (Q4998904) (← links)
• Structure vs. Efficiency of the Cross-Entropy Based Population Learning Algorithm for Discrete-Continuous Scheduling with Continuous Resource Discretisation (Q5023085) (← links)
• Gradient-Based Adaptive Stochastic Search for Simulation Optimization Over Continuous Space (Q5131717) (← links)
• (Q5134628) (← links)
• (Q5205541) (← links)
• Learning effective state-feedback controllers through efficient multilevel importance samplers (Q5240668) (← links)
• A Based-DC Programming Approach for Planning a Multisensor Multizone Search for a Moving Target (Q5356975) (← links)
• Optimizing a Sensor Deployment with Network Constraints Computable by Costly Requests (Q5357758) (← links)