Sciweavers

282 search results - page 42 / 57
» Robust Query Processing through Progressive Optimization
Sort
View
VLDB
1995
ACM
129views Database» more  VLDB 1995»
14 years 1 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...
VLDB
2007
ACM
181views Database» more  VLDB 2007»
14 years 10 months ago
STAR: Self-Tuning Aggregation for Scalable Monitoring
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
Navendu Jain, Michael Dahlin, Yin Zhang, Dmitry Ki...
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
14 years 4 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
EMSOFT
2004
Springer
14 years 3 months ago
Practical PACE for embedded systems
In current embedded systems, one of the major concerns is energy conservation. The dynamic voltage-scheduling (DVS) framework, which involves dynamically adjusting the voltage and...
Ruibin Xu, Chenhai Xi, Rami G. Melhem, Daniel Moss...
ICIP
2005
IEEE
15 years 1 days ago
Game-theoretic analysis of a semi-fragile watermarking scheme based on SCS
Semi-fragile watermarking can be used to detect illegal and local manipulation of images, while being robust towards legal manipulations such as lossy compression. This paper desc...
Jean-Philippe Boyer, Pierre Duhamel, Jacques Blanc...