We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
The multi-armed bandit problem for a gambler is to decide which arm of a K-slot machine to pull to maximize his total reward in a series of trials. Many real-world learning and opt...
- In this work we are analyzing scalability of the heuristic algorithm we used in the past [1-4] to discover knowledge from multi-valued symbolic attributes in fuzzy databases. The...
This paper presents a methodology for using heuristic search methods to optimise cancer chemotherapy. Specifically, two evolutionary algorithms - Population Based Incremental Lear...
Andrei Petrovski, Siddhartha Shakya, John A. W. Mc...
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
Desmond S. Lun, Niranjan Ratnakar, Ralf Koetter, M...