The following pages link to Eugene jun. Santos (Q1125780):
Displaying 15 items.
- Exploiting case-based independence for approximating marginal probabilities (Q1125781) (← links)
- A linear constraint satisfaction approach to cost-based abduction (Q1313953) (← links)
- On multiple spline approximations for Bayesian computations (Q1370600) (← links)
- Implicitly preserving semantics during incremental knowledge base acquisition under uncertainty. (Q1400222) (← links)
- Reasoning with BKBs -- algorithms and complexity (Q1430299) (← links)
- Automatic emergence detection in complex systems (Q1674830) (← links)
- Probabilistic temporal networks: A unified framework for reasoning with time and uncertainty (Q1807606) (← links)
- Designing optimal algorithms for solving banded triangular systems on rings (Q1868492) (← links)
- Polynomial solvability of cost-based abduction (Q2676566) (← links)
- DIRECTING GENETIC ALGORITHMS FOR PROBABILISTIC REASONING THROUGH REINFORCEMENT LEARNING (Q3427875) (← links)
- Satisfying constraint sets through convex envelopes (Q3429327) (← links)
- Modelling cyclicity and generalized cost-based abduction using linear constraint satisfaction (Q4286534) (← links)
- On linear potential functions for approximating Bayesian computations (Q4371675) (← links)
- A framework for building knowledge-bases under uncertainty (Q4421246) (← links)
- (Q4436876) (← links)