We present a new and more efficient heuristic by restricting lookahead saturation (LAS) with NVO (neighbourhood variable ordering) and DEW (dynamic equality weighting). We report o...
Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons,...
In an object oriented, distributed environment, program maintenance, which has never been the most predictable task, becomes even more uncertain. Java's dynamic loading mecha...
An important hypothesis of the research reported in this paper is that dynamic space warping (DSW), a dynamic programming (DP) technique (Bellman 1965, Brown 1996), can be effecti...
Action languages allow for compactly describing dynamic domains. They are usually implemented by compilation, e.g., to Answer Set Programming. To this end, we developed a tool, cal...