Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
Roie Zivan, Uri Shapen, Moshe Zazone, Amnon Meisel...
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
This paper presents a path planner for Unmanned Air Vehicles (UAVs) based on Evolutionary Algorithms (EA) that can be used in realistic risky scenarios. The path returned by the a...
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...