Most popular programming languages are strict. In a strict language, the binding of a variable to an expression coincides with the evaluation of the expression. Non-strict languages attempt to make life easier for programmers by decoupling expression binding and expression evaluation. In a non-strict language, a variable can be bound to an unevaluated expression, and such expressions can be pas...

Over the last decade, methods for multiagent planning under uncertainty have increased in scalability. However, many methods assume value factorization or are not able to provide quality guarantees. We propose a novel family of influence-optimistic upper bounds on the optimal value for problems with 100s of agents that do not exhibit value factorization.

We propose a tightening sequence of optimistic approximations to the Gittins index in “Optimistic Indices.” show that use these concert with an increasing discount factor appears offer compelling alternative state-of-the-art schemes proposed for Bayesian multiarmed bandit problem. prove indices constitutes regret optimal algorithm. Perhaps more interestingly, even loosest substantial performanc...

Optimistic concurrency relies on speculative execution, read-write conflict detection, and checkpointrollback techniques to provide a programming model that replaces locks with the abstraction of atomic, isolated execution of critical sections. Previous research has shown that on chip multi-processors, a class of workloads featuring irregular parallelism and rare read-write conflicts can reap s...

In recent decades there has been an increasing attention in research of optimal control theory with uncertainties. An important issue to deal with the optimal control problem with uncertainties is how to determine some optimization criterion to optimize objective function. Actually, there are many criteria to do so but there is no any criteria to be best because different criteria satisfy vario...