Search
Search Results
-
Search for Weights in the Problem of Finite-Rank Signal Estimation in the Presence of Random Noise
AbstractThe problem of weighted finite-rank series approximation of a time-series aimed at estimating the signal in the “signal plus noise” model,...
-
Online model adaptation in Monte Carlo tree search planning
We propose a model-based reinforcement learning method using Monte Carlo Tree Search planning. The approach assumes a black-box approximated model of...
-
Mini-Batch Adaptive Random Search Method for the Parametric Identification of Dynamic Systems
A possible method for estimating the unknown parameters of dynamic models described by differential-algebraic equations is considered. The parameters...
-
Cooperation in combinatorial search
In the game theoretical approach of the basic problem in Combinatorial Search an adversary thinks of a defective element d of an n -element pool X ,...
-
GPU for Monte Carlo Search
Monte Carlo Search algorithms can give excellent results for some combinatorial optimization problems and for some games. They can be parallelized...
-
The uniform sparse FFT with application to PDEs with random coefficients
We develop the uniform sparse Fast Fourier Transform (usFFT), an efficient, non-intrusive, adaptive algorithm for the solution of elliptic partial...
-
Constructing Random Steiner Triple Systems: An Experimental Study
Several methods for generating random Steiner triple systems (STSs) have been proposed in the literature, such as Stinson’s hill-climbing algorithm...
-
Identification of Linear Systems Using Binary Sensors with Random Thresholds
In this paper, the problem of identifying autoregressive-moving-average systems under random threshold binary-valued output measurements is...
-
Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem
We study the recent metaheuristic search algorithm for the multidimensional assignment problem (MAP) using fitness landscape theory. The analyzed...
-
A fast non-monotone line search for stochastic gradient descent
We give an improved non-monotone line search algorithm for stochastic gradient descent (SGD) for functions that satisfy interpolation conditions. We...
-
Private measures, random walks, and synthetic data
Differential privacy is a mathematical concept that provides an information-theoretic security guarantee. While differential privacy has emerged as a...
-
Towards Tackling MaxSAT by Combining Nested Monte Carlo with Local Search
Recent work proposed the UCTMAXSAT algorithm to address Maximum Satisfiability Problems (MaxSAT) and shown improved performance over pure Stochastic...
-
Multi-objective newsboy problem with random-fuzzy demand
In recent years, the entire nation has expressed deep concern over the escalating greenhouse gas emissions that contribute to global warming. In...
-
Fat-tailed distributions for continuous variable neighborhood search
Using the Gaussian normal distribution on the whole solution space in the continuous variable neighborhood search method has shown similar success as...
-
SRMD: Sparse Random Mode Decomposition
Signal decomposition and multiscale signal analysis provide many useful tools for time-frequency analysis. We proposed a random feature method for...
-
Effective adaptive large neighborhood search for a firefighters timetabling problem
Every year, wildfires accentuated by global warming, cause economic and ecological losses, and often, human casualties. Increasing operational...
-
ESTIMATING THE PARAMETERS OF GENERALIZED LOGISTIC DISTRIBUTION VIA GENETIC ALGORITHM BASED ON REDUCED SEARCH SPACE
In this study, maximum likelihood (ML) estimates of the parameters of generalized logistic (GL) distribution are obtained using the genetic algorithm...
-
A large-scale neighborhood search algorithm for multi-activity tour scheduling problems
In this research, we study multi-activity tour scheduling problems with heterogeneous employees in a service sector where demand varies greatly...
-
A Derivative-free Two Level Random Search Method for Unconstrained Optimization
The book is intended for graduate students and researchers in mathematics, computer science, and operational research. The book presents a new...
-
Hybrid variable neighborhood search for automated warehouse scheduling
We study a new scheduling problem which arise in real-life applications, such as managing complicated warehouses, storage areas, e-commerce malls....
