We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...
This paper describes the client-server design, implementation and experimental results for a system that supports real-time visual interaction between a large number of users in a...
This paper presents a sequential state estimation method with arbitrary probabilistic models expressing the system’s belief. Probabilistic models can be estimated by Maximum a po...
— We consider problems where multiple agents must cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchange...
Abstract— Almost all learning machines used in computational intelligence are not regular but singular statistical models, because they are nonidentifiable and their Fisher info...