Sciweavers

4047 search results - page 11 / 810
» The Discrete Basis Problem
Sort
View
AIPS
2006
13 years 8 months ago
Solving Factored MDPs with Exponential-Family Transition Models
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
CORR
2010
Springer
209views Education» more  CORR 2010»
13 years 7 months ago
An Algorithm to Extract Rules from Artificial Neural Networks for Medical Diagnosis Problems
Artificial neural networks (ANNs) have been successfully applied to solve a variety of classification and function approximation problems. Although ANNs can generally predict bett...
S. M. Kamruzzaman, Md. Monirul Islam
COMPUTING
2008
174views more  COMPUTING 2008»
13 years 7 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
JMM2
2007
147views more  JMM2 2007»
13 years 7 months ago
Selection of Mother Wavelet For Image Compression on Basis of Nature of Image
Recently discrete wavelet transform and wavelet packet has emerged as popular techniques for image compression. The wavelet transform is one of the major processing components of i...
Gajanan K. Kharate, Varsha H. Patil, Niranjan L. B...
CIE
2006
Springer
13 years 9 months ago
Do Noetherian Modules Have Noetherian Basis Functions?
In Bishop-style constructive algebra it is known that if a module over a commutative ring has a Noetherian basis function, then it is Noetherian. Using countable choice we prove th...
Peter Schuster, Júlia Zappe