342 search results - page 66 / 69 » Automatic Generation of Heuristics for Scheduling |
163
click to vote
POPL
2006
ACM
15 years 9 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
GLVLSI
2007
IEEE
15 years 3 months ago
2007
IEEE
We propose an interconnect reorganization algorithm for reduction stages in parallel multipliers. It aims at minimizing power consumption for given static probabilities at the pri...
BTW
2007
Springer
15 years 3 months ago
2007
Springer
Abstract: Peer data management systems (PDMS) are a highly dynamic, decentralized infrastructure for large-scale data integration. They consist of a dynamic set of autonomous peers...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
PG
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper we revisit the cells-and-portals visibility methods, originally developed for the special case of architectural interiors. We define an effectiveness measure for a ...