Sciweavers

708 search results - page 30 / 142
» Timing closure: the solution and its problems
Sort
View
SOCC
2008
IEEE
124views Education» more  SOCC 2008»
15 years 4 months ago
Energy minimization using a greedy randomized heuristic for the voltage assignment problem in NoC
— Scaling down the voltage levels of the processing elements (PEs) in a Network-on-Chip (NoC) can significantly reduce the computation energy consumption with an overhead of the...
Pavel Ghosh, Arunabha Sen
SAC
2004
ACM
15 years 3 months ago
An improved hybrid genetic algorithm for the generalized assignment problem
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
Harald Feltl, Günther R. Raidl
HICSS
1994
IEEE
149views Biometrics» more  HICSS 1994»
15 years 2 months ago
Stochastic Problem Solving by Local Computation Based on Self-Organization Paradigm
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
Yasusi Kanada, Masao Hirokawa
BMCBI
2010
95views more  BMCBI 2010»
14 years 10 months ago
Heuristics for the inversion median problem
Background: The study of genome rearrangements has become a mainstay of phylogenetics and comparative genomics. Fundamental in such a study is the median problem: given three geno...
Vaibhav Rajan, Andrew Wei Xu, Yu Lin, Krister M. S...
EOR
2007
90views more  EOR 2007»
14 years 10 months ago
Accelerating column generation for variable sized bin-packing problems
In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...
Cláudio Alves, José M. Valéri...