Sciweavers

3928 search results - page 518 / 786
» Optimal suffix selection
Sort
View
CASES
2004
ACM
15 years 10 months ago
Scalable custom instructions identification for instruction-set extensible processors
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
Pan Yu, Tulika Mitra
CAAN
2006
Springer
15 years 10 months ago
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...
Boris Goldengorin, Gerold Jäger, Paul Molitor
CC
2006
Springer
125views System Software» more  CC 2006»
15 years 10 months ago
Converting Intermediate Code to Assembly Code Using Declarative Machine Descriptions
Abstract. Writing an optimizing back end is expensive, in part because it requires mastery of both a target machine and a compiler's internals. We separate these concerns by i...
João Dias, Norman Ramsey
FPL
2004
Springer
143views Hardware» more  FPL 2004»
15 years 10 months ago
Exploring Area/Delay Tradeoffs in an AES FPGA Implementation
Abstract. Field-Programmable Gate Arrays (FPGAs) have lately become a popular target for implementing cryptographic block ciphers, as a well-designed FPGA solution can combine some...
Joseph Zambreno, David Nguyen, Alok N. Choudhary
ECAI
2006
Springer
15 years 10 months ago
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
Radu Marinescu 0002, Rina Dechter