SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
Two notions of optimality have been explored in previous work on hierarchical reinforcement learning (HRL): hierarchical optimality, or the optimal policy in the space defined by ...
In this paper, we present a novel method for the classification of Web sites. This method exploits both structure and content of Web sites in order to discern their functionality....
Current Network User Interfaces (NUIs) provide entrances to an enormous amount of Web-based services, bringing about new use problems such as laborious and unsuccessful navigation...
Mark A. Neerincx, Jasper Lindenberg, Steven Pember...
Incorporating components from a number of different sources into a given application is generally considered to be a non-trivial activity. Over the years, various coordination mec...