Sciweavers

342 search results - page 50 / 69
» Constrained Integer Partitions
Sort
View
MP
2002
143views more  MP 2002»
13 years 10 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
CASES
2006
ACM
14 years 4 months ago
Integrated scratchpad memory optimization and task scheduling for MPSoC architectures
Multiprocessor system-on-chip (MPSoC) is an integrated circuit containing multiple instruction-set processors on a single chip that implements most of the functionality of a compl...
Vivy Suhendra, Chandrashekar Raghavan, Tulika Mitr...
ICCAD
1999
IEEE
81views Hardware» more  ICCAD 1999»
14 years 3 months ago
Modeling design constraints and biasing in simulation using BDDs
Constraining and input biasing are frequently used techniques in functional verification methodologies based on randomized simulation generation. Constraints confine the simulatio...
Jun Yuan, Kurt Shultz, Carl Pixley, Hillel Miller,...
DATE
2007
IEEE
142views Hardware» more  DATE 2007»
14 years 5 months ago
Optimizing instruction-set extensible processors under data bandwidth constraints
We present a methodology for generating optimized architectures for data bandwidth constrained extensible processors. We describe a scalable Integer Linear Programming (ILP) formu...
Kubilay Atasu, Robert G. Dimond, Oskar Mencer, Way...
ICPP
2006
IEEE
14 years 4 months ago
Worst-Case Delay Control in Multi-Group Overlay Networks
This paper proposes a novel and simple adaptive control algorithm for the effective delay control and resource utilization of EMcast when the traffic load becomes heavy in the mu...
Wanqing Tu