291 search results - page 22 / 59 » On Generalizing Pawlak Approximation Operators |
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
ICIP
1997
IEEE
14 years 10 months ago
1997
IEEE
A new method termed the vertex representation is presented for approximating the shapes of objects of arbitrary dimensionality d (e.g., 20, 30, etc.) with orthogonal (d - 1)-dimen...
ECML
2006
Springer
14 years 8 days ago
2006
Springer
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Design optimization is a well established application field of evolutionary computation. However, standard recombination operators acting on the genotypic representation of the d...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— Q-learning is a technique used to compute an optimal policy for a controlled Markov chain based on observations of the system controlled using a non-optimal policy. It ...