Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Abstract. In recent years, within the planning literature there has been a departure from approaches computing total plans for given goals, in favour of approaches computing partia...
Paolo Mancarella, Fariba Sadri, Giacomo Terreni, F...
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Abstract. One of the most important features in an urban geographic information system is the ability to locate addresses, in any form employed by the population, in a quick and ef...
Clodoveu A. Davis, Frederico T. Fonseca, Karla A. ...
Generating query-answering plans for information gathering agents requires to translate a user query, formulated in terms of a set of virtual relations, to a query that uses relat...