1399 search results - page 270 / 280 » New Algorithms for k-Center and Extensions |
CCGRID
2005
IEEE
14 years 2 months ago
2005
IEEE
Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG...
ANCS
2005
ACM
14 years 2 months ago
2005
ACM
Task to resource mapping problems are encountered during (i) hardware-software co-design and (ii) performance optimization of Network Processor systems. The goal of the first pro...
ISPD
2005
ACM
14 years 2 months ago
2005
ACM
Placement is a critical component of today's physical synthesis flow with tremendous impact on the final performance of VLSI designs. However, it accounts for a significant p...
SENSYS
2005
ACM
14 years 2 months ago
2005
ACM
This paper presents the Simple Packet Combining (SPaC) error-correction scheme for wireless sensor networks. Nodes buffer corrupt packets, and when two or more corrupt versions o...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...