Traditional single-agent search algorithms usually make simplifying assumptions (single search agent, stationary target, complete knowledge of the state, and sufficient time). The...
Mark Goldenberg, Alexander Kovarsky, Xiaomeng Wu, ...
Recently-developed techniques have improved the performance of production systems several times over. However, these techniques are not yet adequate for continuous problem solving...
In this paper we apply the well known sample average approximation (SAA) method to solve a class of stochastic variational inequality problems (SVIPs). We investigate the existenc...
Static program analysis techniques cannot know certain values, such as the value of user input or network state, at analysis time. While such unknown values need to be treated as ...
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...