Sciweavers

4117 search results - page 535 / 824
» On the Satisfiability of Complex Constraints
Sort
View
EDBTW
2006
Springer
15 years 10 months ago
Hash-Based Structural Join Algorithms
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
Christian Mathis, Theo Härder
EMISA
2006
Springer
15 years 10 months ago
Challenges and Solutions in Planning Information Systems for Networked Value Constellations
: Nowadays businesses often decide to form networked value constellations in order to satisfy complex customer needs. To fulfill the value-based requirements of an e-Business idea ...
Novica Zarvic, Maya Daneva
ESTIMEDIA
2006
Springer
15 years 10 months ago
Loop Nest Splitting for WCET-Optimization and Predictability Improvement
This paper presents the influence of the loop nest splitting source code optimization on the worst-case execution time (WCET). Loop nest splitting minimizes the number of executed...
Heiko Falk, Martin Schwarzer
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 10 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 10 months ago
Mining asynchronous periodic patterns in time series data
Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and d...
Jiong Yang, Wei Wang 0010, Philip S. Yu