Sciweavers

9842 search results - page 1702 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICCD
2004
IEEE
135views Hardware» more  ICCD 2004»
16 years 1 months ago
Design Methodologies and Architecture Solutions for High-Performance Interconnects
In Deep Sub-Micron (DSM) technologies, interconnects play a crucial role in the correct functionality and largely impact the performance of complex System-on-Chip (SoC) designs. F...
Davide Pandini, Cristiano Forzan, Livio Baldi
139
Voted
ICPP
2009
IEEE
15 years 11 months ago
Bank-aware Dynamic Cache Partitioning for Multicore Architectures
Abstract—As Chip-Multiprocessor systems (CMP) have become the predominant topology for leading microprocessors, critical components of the system are now integrated on a single c...
Dimitris Kaseridis, Jeffrey Stuecheli, Lizy K. Joh...
IPPS
2009
IEEE
15 years 11 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
IROS
2009
IEEE
138views Robotics» more  IROS 2009»
15 years 11 months ago
Using eigenposes for lossless periodic human motion imitation
— Programming a humanoid robot to perform an action that takes the robot’s complex dynamics into account is a challenging problem. Traditional approaches typically require high...
Rawichote Chalodhorn, Rajesh P. N. Rao
MICRO
2009
IEEE
132views Hardware» more  MICRO 2009»
15 years 11 months ago
Finding concurrency bugs with context-aware communication graphs
Incorrect thread synchronization often leads to concurrency bugs that manifest nondeterministically and are difficult to detect and fix. Past work on detecting concurrency bugs ...
Brandon Lucia, Luis Ceze
« Prev « First page 1702 / 1969 Last » Next »