Sciweavers

1149 search results - page 208 / 230
» Minimally non-Pfaffian graphs
Sort
View
DAC
1989
ACM
13 years 11 months ago
Scheduling and Binding Algorithms for High-Level Synthesis
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
Pierre G. Paulin, John P. Knight
ICC
2007
IEEE
150views Communications» more  ICC 2007»
13 years 11 months ago
ACE Spectrum of LDPC Codes and Generalized ACE Design
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
Dejan Vukobratovic, Aleksandar Djurendic, Vojin Se...
CASES
2001
ACM
13 years 11 months ago
Computation offloading to save energy on handheld devices: a partition scheme
We consider handheld computing devices which are connected to a server (or a powerful desktop machine) via a wireless LAN. On such devices, it is often possible to save the energy...
Zhiyuan Li, Cheng Wang, Rong Xu
DAC
1995
ACM
13 years 11 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram
ASPDAC
2008
ACM
74views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Large-scale fixed-outline floorplanning design using convex optimization techniques
A two-stage optimization methodology is proposed to solve the fixed-outline floorplanning problem that is a global optimization problem for wirelength minimization. In the first st...
Chaomin Luo, Miguel F. Anjos, Anthony Vannelli