Sciweavers

2800 search results - page 209 / 560
» Scaling RDF with time
Sort
View
SWAT
2004
Springer
142views Algorithms» more  SWAT 2004»
15 years 12 months ago
Getting the Best Response for Your Erg
We consider the speed scaling problem of minimizing the average response time of a collection of dynamically released jobs subject to a constraint A on energy used. We propose an ...
Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woe...
DATE
2002
IEEE
69views Hardware» more  DATE 2002»
15 years 11 months ago
Flip-Flop and Repeater Insertion for Early Interconnect Planning
We present a unified framework that considers flipflop and repeater insertion and the placement of flipflop/repeater blocks during RT or higher level design. We introduce the...
Ruibing Lu, Guoan Zhong, Cheng-Kok Koh, Kai-Yuan C...
HICSS
2002
IEEE
135views Biometrics» more  HICSS 2002»
15 years 11 months ago
Integrated Production Planning and Route Scheduling in Pulp Mill Industry
In this paper we consider the complete supply chain for a large pulp producer in Sweden. The supply chain is divided up in two parts, the pulp production planning problem and the ...
David Bredström, Mikael Rönnqvist
IPPS
1997
IEEE
15 years 11 months ago
A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
Smaïl Niar, Arnaud Fréville
ASPDAC
2006
ACM
108views Hardware» more  ASPDAC 2006»
15 years 10 months ago
Spec-based flip-flop and latch repeater planning
Abstract-- Shrinking process geometries and frequency scaling give rise to an increasing number of interconnects that require multiple clock cycles. This paper explores efficient t...
Man Chung Hon