666 search results - page 33 / 134 » When Similar Problems Don't Have Similar Solutions |
IJCAI
2003
13 years 10 months ago
2003
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...
CP
2000
Springer
14 years 1 months ago
2000
Springer
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...
CP
2008
Springer
13 years 10 months ago
2008
Springer
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...
ICCBR
2010
Springer
14 years 23 days ago
2010
Springer
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,...
ICIP
2005
IEEE
14 years 10 months ago
2005
IEEE
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...