Sciweavers

4378 search results - page 790 / 876
» On the Complexity of Ordered Colourings
Sort
View
BROADNETS
2006
IEEE
14 years 4 months ago
Distributed Job Scheduling based on Multiple Constraints Anycast Routing
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
Tim Stevens, Marc De Leenheer, Filip De Turck, Bar...
CODES
2006
IEEE
14 years 4 months ago
Generic netlist representation for system and PE level design exploration
Designer productivity and design predictability are vital factors for successful embedded system design. Shrinking time-to-market and increasing complexity of these systems requir...
Bita Gorjiara, Mehrdad Reshadi, Pramod Chandraiah,...
CODES
2006
IEEE
14 years 4 months ago
A buffer-sizing algorithm for networks on chip using TDMA and credit-based end-to-end flow control
When designing a System-on-Chip (SoC) using a Networkon-Chip (NoC), silicon area and power consumption are two key elements to optimize. A dominant part of the NoC area and power ...
Martijn Coenen, Srinivasan Murali, Andrei Radulesc...
GLOBECOM
2006
IEEE
14 years 4 months ago
Linear Coherent Decentralized Estimation
Abstract—We consider the distributed estimation of an unknown vector signal in a resource constrained sensor network with a fusion center. Due to power and bandwidth limitations,...
Jinjun Xiao, Shuguang Cui, Zhi-Quan Luo, Andrea J....
ICPP
2006
IEEE
14 years 4 months ago
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
David A. Bader, Kamesh Madduri