Sciweavers

725 search results - page 22 / 145
» Smoothed Analysis of Algorithms and Heuristics
Sort
View
ISCAPDCS
2007
14 years 11 months ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel
ICTAI
2007
IEEE
15 years 4 months ago
Curve Clustering with Spatial Constraints for Analysis of Spatiotemporal Data
In this paper we present a new approach for curve clustering designed for analysis of spatiotemporal data. Such kind of data contains both spatial and temporal patterns that we de...
Konstantinos Blekas, Christophoros Nikou, Nikolas ...
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
15 years 4 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
GLVLSI
2003
IEEE
153views VLSI» more  GLVLSI 2003»
15 years 3 months ago
FORCE: a fast and easy-to-implement variable-ordering heuristic
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
SAC
2005
ACM
15 years 3 months ago
Adaptation point analysis for computation migration/checkpointing
Finding the appropriate location of adaptation points for computation migration/checkpointing is critical since the distance between two consecutive adaptation points determines t...
Yanqing Ji, Hai Jiang, Vipin Chaudhary