2957 search results - page 255 / 592 » The Complexity of Polynomial-Time Approximation |
166
click to vote
CGF
2005
15 years 6 months ago
2005
Aiming at robust surface structure recovery, we extend the powerful optimization technique of variational shape approximation by allowing for several different primitives to repre...
170
click to vote
JAIR
2000
15 years 6 months ago
2000
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
198
click to vote
PE
2010
Springer
15 years 5 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
198
click to vote
DLOG
2010
15 years 4 months ago
2010
ABox Reasoning in large scale description logic (DL) knowledge bases, e.g. ontologies, is important for the success of many semantic-enriched systems. Performance of existing appro...
168
click to vote
EUSFLAT
2009
15 years 4 months ago
2009
Neural Networks (NN), Type-1 Fuzzy Logic Systems (T1FLS) and Interval Type-2 Fuzzy Logic Systems (IT2FLS) are universal approximators, they can approximate any non-linear function....