Sciweavers

1450 search results - page 139 / 290
» On the Complexity of Hardness Amplification
Sort
View
PPSN
2000
Springer
14 years 24 days ago
Optimizing through Co-evolutionary Avalanches
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...
EDBTW
2010
Springer
13 years 7 months ago
Using web-based personalization on spatial data warehouses
Spatial data warehouses (SDW) rely on extended multidimensional (MD) models in order to provide decision makers with appropriate structures to intuitively analyse spatial data. Se...
Octavio Glorio, Jose-Norberto Mazón, Irene ...
DAC
2007
ACM
14 years 10 months ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
Ajay K. Verma, Philip Brisk, Paolo Ienne
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 9 months ago
Supporting Time-Constrained SQL Queries in Oracle
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
WOSP
2010
ACM
14 years 4 months ago
Reducing performance non-determinism via cache-aware page allocation strategies
Performance non-determinism in computer systems complicates evaluation, use, and even development of these systems. In performance evaluation via benchmarking and simulation, nond...
Michal Hocko, Tomás Kalibera