4894 search results - page 450 / 979 » The Guarding Problem - Complexity and Approximation |
168
click to vote
EMNLP
2006
15 years 7 months ago
2006
Random Indexing is a vector space technique that provides an efficient and scalable approximation to distributional similarity problems. We present experiments showing Random Inde...
155
click to vote
ESANN
2006
15 years 7 months ago
2006
We focus on neuro-dynamic programming methods to learn state-action value functions and outline some of the inherent problems to be faced, when performing reinforcement learning in...
173
click to vote
NIPS
2001
15 years 7 months ago
2001
In this paper we will show that a restricted class of constrained minimum divergence problems, named generalized inference problems, can be solved by approximating the KL divergen...
143
click to vote
JFPLC
2003
15 years 7 months ago
2003
ABSTRACT. We present PICPA, a new algorithm for tackling constrained continuous multiobjective problems. The algorithm combines constraint propagation techniques and evolutionary c...
161
click to vote
AAAI
1997
15 years 7 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...