Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively gui...
Patrik Haslum, Adi Botea, Malte Helmert, Blai Bone...
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
Machine learning and data mining have become aware that using constraints when learning patterns and rules can be very useful. To this end, a large number of special purpose syste...
Using computers for different task including enhancement, description and evaluation of signals we typically include three steps: signal processing (for obtaining signal of better ...
Abstract--This paper presents an approach to the task of locating a group of buildings based solely on their relative spatial relationships. This situation can occur in the problem...