Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Reservation table scheduling: branch-and-bound based optimization . integer linear programming techniques

Hadda CherrounAlain DartePaul Feautrier — 2007

RAIRO - Operations Research

The recourse to operation research solutions has strongly increased the performances of scheduling task in the High-Level Synthesis (called hardware compilation). Scheduling a whole program is not possible as too many constraints and objectives interact. We decompose high-level scheduling in three steps. Step 1: Coarse-grain scheduling tries to exploit parallelism and locality of the whole program (in particular in loops, possibly imperfectly nested) with a rough view of the target architecture....

Tree pattern matching from regular tree expressions

In this work we deal with tree pattern matching over ranked trees, where the pattern set to be matched against is defined by a regular tree expression. We present a new method that uses a tree automaton constructed inductively from a regular tree expression. First we construct a special tree automaton for the regular tree expression of the pattern E , which is somehow a generalization of Thompson automaton for strings. Then we run the constructed automaton on the subject tree t . The pattern matching...

Page 1

Download Results (CSV)