Sciweavers

2520 search results - page 329 / 504
» The complexity of approximating entropy
Sort
View
KI
2007
Springer
15 years 6 months ago
Solving Decentralized Continuous Markov Decision Problems with Structured Reward
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
Emmanuel Benazera
ARTMED
2002
121views more  ARTMED 2002»
15 years 6 months ago
An evolutionary artificial neural networks approach for breast cancer diagnosis
This paper presents an evolutionary artificial neural network approach based on the pareto differential evolution algorithm augmented with local search for the prediction of breas...
Hussein A. Abbass
JC
2002
50views more  JC 2002»
15 years 6 months ago
Verifying Topological Indices for Higher-Order Rank Deficiencies
It has been known how to use computational fixed point theorems to verify existence and uniqueness of a true solution to a nonlinear system of equations within a small region abou...
R. Baker Kearfott, Jianwei Dian
MT
1998
91views more  MT 1998»
15 years 6 months ago
A Controlled Skip Parser
Real-world natural language sentences are long and complex, and always contain unexpected grammatical constructions. It even includes noise and ungrammaticality. This paper descri...
Kenji Yamada
TIT
1998
126views more  TIT 1998»
15 years 6 months ago
An Asymptotic Property of Model Selection Criteria
—Probability models are estimated by use of penalized log-likelihood criteria related to AIC and MDL. The accuracies of the density estimators are shown to be related to the trad...
Yuhong Yang, Andrew R. Barron