Sciweavers

505 search results - page 36 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
DAC
2006
ACM
14 years 9 months ago
Efficient SAT-based Boolean matching for FPGA technology mapping
Most FPGA technology mapping approaches either target Lookup Tables (LUTs) or relatively simple Programmable Logic Blocks (PLBs). Considering networks of PLBs during technology map...
Sean Safarpour, Andreas G. Veneris, Gregg Baeckler...
TON
2008
109views more  TON 2008»
13 years 8 months ago
On hierarchical traffic grooming in WDM networks
Abstract--The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any ...
Bensong Chen, George N. Rouskas, Rudra Dutta
MOBIHOC
2006
ACM
14 years 8 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano
INFOCOM
2012
IEEE
11 years 11 months ago
Towards energy-fairness in asynchronous duty-cycling sensor networks
Abstract—In this paper, we investigate the problem of controlling node sleep intervals so as to achieve the min-max energy fairness in asynchronous duty-cycling sensor networks. ...
Zhenjiang Li, Mo Li, Yunhao Liu
EMSOFT
2009
Springer
14 years 11 days ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond