Sciweavers

1104 search results - page 42 / 221
» Experimental evaluation of optimal CSMA
Sort
View
CGO
2003
IEEE
14 years 1 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
ICDE
2005
IEEE
114views Database» more  ICDE 2005»
14 years 3 months ago
VAMANA - A Scalable Cost-Driven XPath Engine
¡ Several systems have recently been proposed for the evaluation of XPath expressions. However, none of these systems have demonstrated both scalability with large document sizes ...
Venkatesh Raghavan, Kurt W. Deschler, Elke A. Rund...
GECCO
2008
Springer
147views Optimization» more  GECCO 2008»
13 years 11 months ago
On selecting the best individual in noisy environments
In evolutionary algorithms, the typical post-processing phase involves selection of the best-of-run individual, which becomes the final outcome of the evolutionary run. Trivial f...
Wojciech Jaskowski, Wojciech Kotlowski
CORIA
2008
13 years 11 months ago
Involving Validity Indices in Document Clustering
The goal of any clustering algorithm is to find the optimal clustering solution with the optimal number of clusters. In order to evaluate a clustering solution, a number of validit...
Ahmad El Sayed, Hakim Hacid, Djamel A. Zighed
CIKM
2005
Springer
14 years 3 months ago
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
Neoklis Polyzotis