Abstract. A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically ...
We address a large scale waste collection vehicle routing problem with time windows (VRPTW) complicated by multiple disposal trips and drivers lunch breaks. A fitness search spac...
Andrew Runka, Beatrice M. Ombuki-Berman, Mario Ven...
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...
In this paper we tackle the problem of simplifying tree-based regression models, called model trees, which are characterized by two types of internal nodes, namely regression nodes...