We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
Daniel S. Heller, Aurojit Panda, Meinolf Sellmann,...
The concept of diversity was successfully introduced for recommender-systems. By displaying results that are not only similar to a target problem but also diverse among themselves,...
The autofocus problem in synthetic aperture radar (SAR) is considered. We precisely characterize the multichannel nature of the SAR autofocus problem by constructing a low-dimensi...