ct 7 Modern technology is succeeding in delivering more information to people at ever faster rates. Under traditional 8 views of rational decision making where individuals should e...
This paper introduces a choice-based method that for the first time makes it possible to quantitatively measure regret theory, one of the most popular models of decision under unc...
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...