Sciweavers

28 search results - page 2 / 6
» Partitioning graphs of supply and demand
Sort
View
INFOCOM
1998
IEEE
13 years 9 months ago
Informed-Source Coding-on-Demand (ISCOD) over Broadcast Channels
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
Yitzhak Birk, Tomer Kol
STACS
2010
Springer
14 years 8 days ago
Robust Fault Tolerant Uncapacitated Facility Location
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...
Shiri Chechik, David Peleg
DATE
2004
IEEE
114views Hardware» more  DATE 2004»
13 years 9 months ago
Power Aware Variable Partitioning and Instruction Scheduling for Multiple Memory Banks
Many high-end DSP processors employ both multiple memory banks and heterogeneous register files to improve performance and power consumption. The complexity of such architectures ...
Zhong Wang, Xiaobo Sharon Hu
ACRI
2010
Springer
13 years 2 months ago
Using Cellular Automata on a Graph to Model the Exchanges of Cash and Goods
This paper investigates the behaviors and the properties of a "Give and Take" cellular automaton on a graph. Using an economical metaphor, this model implements the excha...
Ranaivo Mahaleo Razakanirina, Bastien Chopard
ICASSP
2008
IEEE
13 years 11 months ago
Address assignment sensitive variable partitioning and scheduling for DSPS with multiple memory banks
Multiple memory banks design is employed in many high performance DSP processors. This architectural feature supports higher memory bandwidth by allowing multiple data memory acce...
Chun Jason Xue, Tiantian Liu, Zili Shao, Jingtong ...