10907 search results - page 1820 / 2182 » Constraint Based Strategies |
164
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
228
click to vote
HIPEAC
2009
Springer
16 years 1 months ago
2009
Springer
Heterogeneous architectures are currently widespread. With the advent of easy-to-program general purpose GPUs, virtually every recent desktop computer is a heterogeneous system. Co...
187
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
170
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
167
Voted
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—In this paper, two general algorithms for the automatic generation of instruction-set extensions are presented. The basic instruction set of a reconfigurable architectu...