Sciweavers

4539 search results - page 521 / 908
» Approaches to Compute Workflow Complexity
Sort
View
EDBT
2010
ACM
200views Database» more  EDBT 2010»
16 years 1 months ago
Rewrite techniques for performance optimization of schema matching processes
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...
Eric Peukert, Henrike Berthold, Erhard Rahm
AINA
2009
IEEE
16 years 1 months ago
Medium Access Control in Large Scale Clusters for Wireless Sensor Networks
—One of the main advantages of clustering algorithms is the ability to allow networks to be physically divided into smaller regions, thereby increasing the theoretical maximum nu...
Pedro N. E. S. Barbosa, Neil M. White, Nick R. Har...
SASO
2009
IEEE
16 years 1 months ago
Evolution of Probabilistic Consensus in Digital Organisms
—The complexity of distributed computing systems and their increasing interaction with the physical world impose challenging requirements in terms of adaptation, robustness, and ...
David B. Knoester, Philip K. McKinley
ICST
2009
IEEE
16 years 1 months ago
A Simple Coverage-Based Locator for Multiple Faults
Fault localization helps spotting faults in source code by exploiting automatically collected data. Deviating from other fault locators relying on hit spectra or test coverage inf...
Friedrich Steimann, Mario Bertschler
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
16 years 1 months ago
Multiplicative approximations and the hypervolume indicator
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
Tobias Friedrich, Christian Horoba, Frank Neumann