This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
This paper discusses the dynamic of context through the use of a context-based formalism called contextual graphs that has been initially developed in the SART application for the ...
Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complex...
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...