1 code implementation • 15 Dec 2021 • Francesco d'Amore, Daniel Mitropolsky, Pierluigi Crescenzi, Emanuele Natale, Christos H. Papadimitriou
We revisit the planning problem in the blocks world, and we implement a known heuristic for this task.
no code implementations • 6 Jan 2021 • Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
Our algorithm can be used to solve several different minimum cost path problems in weighted point-availability time-dependent networks with a vast variety of cost definitions, and it can be easily modified in order to deal with the single destination Pareto problem.
Data Structures and Algorithms Networking and Internet Architecture
no code implementations • 25 Nov 2013 • Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata, are unlike context-free grammars in that they do not have a binary normal form.