Sciweavers

417 search results - page 11 / 84
» Performance Analysis of Three Text-Join Algorithms
Sort
View
COMGEO
2004
ACM
14 years 9 months ago
Speeding up the incremental construction of the union of geometric objects in practice
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
Eti Ezra, Dan Halperin, Micha Sharir
JCST
2010
189views more  JCST 2010»
14 years 4 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
15 years 1 months ago
Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...
Riccardo Poli, Leonardo Vanneschi
EC
2008
175views ECommerce» more  EC 2008»
14 years 9 months ago
Multiobjective Immune Algorithm with Nondominated Neighbor-Based Selection
Nondominated Neighbor Immune Algorithm (NNIA) is proposed for multiobjective optimization by using a novel nondominated neighbor-based selection technique, an immune inspired oper...
Maoguo Gong, Licheng Jiao, Haifeng Du, Liefeng Bo
COMCOM
2006
114views more  COMCOM 2006»
14 years 9 months ago
A comparison of epidemic algorithms in wireless sensor networks
We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is nece...
Mert Akdere, Cemal Çagatay Bilgin, Ozan Ger...