B This paper examinesthe integration of computational complexity into gametheoretic models. Theexample focused on is the Prisoner’s Dilemma,repeated for a finite length of time....
Previous work on scheduling dynamic competitive jobs is focused on multiprocessors configurations. This paper presents a new distributed dynamic scheduling scheme for sporadic re...
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
Huibiao Zhu, Shengchao Qin, Jifeng He, Jonathan P....
We consider the task of creating a 3-d model of a large novel environment, given only a small number of images of the scene. This is a difficult problem, because if the images are...
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...