Sciweavers

703 search results - page 42 / 141
» Maintenance scheduling problems as benchmarks for constraint...
Sort
View
CSCLP
2005
Springer
15 years 3 months ago
On Generators of Random Quasigroup Problems
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
Roman Barták
ISLPED
1995
ACM
100views Hardware» more  ISLPED 1995»
15 years 1 months ago
Simultaneous scheduling and binding for power minimization during microarchitecture synthesis
ABSTRACT { Sub-micron technologies and the increasing size and complexity of integrated components have aggravated the e ect of long interconnects and buses, compared to that of ga...
Aurobindo Dasgupta, Ramesh Karri
ISCAS
2006
IEEE
119views Hardware» more  ISCAS 2006»
15 years 3 months ago
Scheduling and binding for low gate leakage nanoCMOS datapath circuit synthesis
In this paper we present two polynomial time-complexity heuristic algorithms for optimization of gate-oxide leakage (tunneling current) during behavioral synthesis through simulta...
Saraju P. Mohanty, Elias Kougianos, Ramakrishna Ve...
ATAL
2008
Springer
14 years 11 months ago
Cost-based BDI plan selection for change propagation
Software maintenance is responsible for as much as two thirds of the cost of any software, and is consequently an important research area. In this paper we focus on the change pro...
Khanh Hoa Dam, Michael Winikoff
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
15 years 4 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...