Sciweavers

96 search results - page 7 / 20
» Variable Ordering Heuristics Show Promise
Sort
View
ISMVL
2003
IEEE
80views Hardware» more  ISMVL 2003»
14 years 3 months ago
Augmented Sifting of Multiple-Valued Decision Diagrams
Discrete functions are now commonly represented by binary (BDD) and multiple-valued (MDD) decision diagrams. Sifting is an effective heuristic technique which applies adjacent var...
D. Michael Miller, Rolf Drechsler
EVOW
2004
Springer
14 years 3 months ago
Binary Merge Model Representation of the Graph Colouring Problem
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
István Juhos, Attila Tóth, Jano I. v...
ASPDAC
2004
ACM
118views Hardware» more  ASPDAC 2004»
14 years 3 months ago
Minimization of memory size for heterogeneous MDDs
Abstract— In this paper, we propose exact and heuristic algorithms for minimizing the memory size for heterogeneous Multivalued Decision Diagrams (MDDs). In a heterogeneous MDD, ...
Shinobu Nagayama, Tsutomu Sasao
RTSS
1998
IEEE
14 years 2 months ago
Synthesis Techniques for Low-Power Hard Real-Time Systems on Variable Voltage Processors
The energy efficiency of systems-on-a-chip can be much improved if one were to vary the supply voltage dynamically at run time. In this paper we describe the synthesis of systems-...
Inki Hong, Gang Qu, Miodrag Potkonjak, Mani B. Sri...
ASPDAC
2001
ACM
137views Hardware» more  ASPDAC 2001»
14 years 1 months ago
Optimized address assignment for DSPs with SIMD memory accesses
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
Markus Lorenz, David Koffmann, Steven Bashford, Ra...