Sciweavers

12194 search results - page 2112 / 2439
» cans 2010
Sort
View
LATIN
2010
Springer
15 years 12 months ago
Prize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
MohammadTaghi Hajiaghayi, Arefeh A. Nasri
RECOMB
2010
Springer
15 years 12 months ago
SubMAP: Aligning Metabolic Pathways with Subnetwork Mappings
Abstract. We consider the problem of aligning two metabolic pathways. Unlike traditional approaches, we do not restrict the alignment to one-to-one mappings between the molecules o...
Ferhat Ay, Tamer Kahveci
DATE
2010
IEEE
107views Hardware» more  DATE 2010»
15 years 12 months ago
An error-correcting unordered code and hardware support for robust asynchronous global communication
A new delay-insensitive data encoding scheme for global asynchronous communication is introduced. The goal of this work is to combine the timing-robustness of delay-insensitive (i....
Melinda Y. Agyekum, Steven M. Nowick
DATE
2010
IEEE
154views Hardware» more  DATE 2010»
15 years 12 months ago
A method to remove deadlocks in Networks-on-Chips with Wormhole flow control
Networks-on-Chip (NoCs) are a promising interconnect paradigm to address the communication bottleneck of Systems-on-Chip (SoCs). Wormhole flow control is widely used as the trans...
Ciprian Seiculescu, Srinivasan Murali, Luca Benini...
ISCA
2010
IEEE
205views Hardware» more  ISCA 2010»
15 years 12 months ago
The virtual write queue: coordinating DRAM and last-level cache policies
In computer architecture, caches have primarily been viewed as a means to hide memory latency from the CPU. Cache policies have focused on anticipating the CPU’s data needs, and...
Jeffrey Stuecheli, Dimitris Kaseridis, David Daly,...
« Prev « First page 2112 / 2439 Last » Next »