Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
To recover depth from images, the human visual system uses many monocular depth cues, which vision research has only begun to explore. Because a given image can have many possible...
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
Abstract. Training neural networks is a complex task of great importance in the supervised learning field of research. In this work we tackle this problem with five algorithms, a...
In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memet...
Neda Shahidi, Hadi Esmaeilzadeh, Marziye Abdollahi...