no code implementations • 27 May 2018 • Ali Shakiba, Amir Kafshdar Goharshady, MohammadReza Hooshmandasl, Mohsen Alambardar Meybodi
We study relations between evidence theory and S-approximation spaces.
no code implementations • 24 Apr 2018 • Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Nastaran Okati
We consider the stochastic shortest path (SSP) problem for succinct Markov decision processes (MDPs), where the MDP consists of a set of variables, and a set of nondeterministic rules that update the variables.
no code implementations • 26 Oct 2015 • Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time.
Programming Languages Data Structures and Algorithms F.3.2
