Lowering computational cost of data analysis and visualization techniques is an essential step towards including the user in the visualization. In this paper we present an improve...
Abstract. Years of work have gone into algorithms and optimizations for twoplayer perfect-information games such as Chess and Checkers. It is only more recently that serious resear...
Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...
Learning systems have been devised as a way of overcoming the knowledge acquisition bottleneck in the development of knowledge-based systems. They often cast learning to a search p...
Nicola Di Mauro, Floriana Esposito, Stefano Ferill...
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...