Sciweavers

244 search results - page 42 / 49
» Intervalizing k-Colored Graphs
Sort
View
CORR
2010
Springer
118views Education» more  CORR 2010»
14 years 9 months ago
Large scale probabilistic available bandwidth estimation
The common utilization-based definition of available bandwidth and many of the existing tools to estimate it suffer from several important weaknesses: i) most tools report a point...
Frederic Thouin, Mark Coates, Michael G. Rabbat
ICCAD
2001
IEEE
126views Hardware» more  ICCAD 2001»
15 years 6 months ago
Constraint Satisfaction for Relative Location Assignment and Scheduling
Tight data- and timing constraints are imposed by communication and multimedia applications. The architecture for the embedded processor imply resource constraints. Instead of ran...
Carlos A. Alba Pinto, Bart Mesman, Jochen A. G. Je...
71
Voted
IPPS
2007
IEEE
15 years 3 months ago
Optimization and evaluation of parallel I/O in BIPS3D parallel irregular application
This paper presents the optimization and evaluation of parallel I/O for the BIPS3D parallel irregular application, a 3-dimensional simulation of BJT and HBT bipolar devices. The p...
Rosa Filgueira, David E. Singh, Florin Isaila, Jes...
CCS
2007
ACM
15 years 3 months ago
Automated detection of persistent kernel control-flow attacks
This paper presents a new approach to dynamically monitoring operating system kernel integrity, based on a property called state-based control-flow integrity (SBCFI). Violations ...
Nick L. Petroni Jr., Michael W. Hicks
AICT
2006
IEEE
15 years 3 months ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...