Sciweavers

3934 search results - page 80 / 787
» Approximate Schedulability Analysis
Sort
View
AGP
1995
IEEE
15 years 9 months ago
Domain Independent Ask Approximation in CCP
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
Enea Zaffanella
IJCSA
2007
110views more  IJCSA 2007»
15 years 6 months ago
Multiprocessor Scheduling Using Hybrid Particle Swarm Optimization with Dynamically Varying Inertia
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
S. N. Sivanandam, P. Visalakshi, A. Bhuvaneswari
WSC
2008
15 years 8 months ago
On the approximation error in high dimensional model representation
Mathematical models are often described by multivariate functions, which are usually approximated by a sum of lower dimensional functions. A major problem is the approximation err...
Xiaoqun Wang
RTSS
2009
IEEE
16 years 1 months ago
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
Recently, there have been several promising techniques developed for schedulability analysis and response time analysis for multiprocessor systems based on over-approximation. Thi...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
CORR
2004
Springer
153views Education» more  CORR 2004»
15 years 6 months ago
Cauchy Annealing Schedule: An Annealing Schedule for Boltzmann Selection Scheme in Evolutionary Algorithms
Abstract-Boltzmann selectionis an important selection mechanism in evolutionary algorithms as it has theoretical properties which help in theoretical analysis. However, Boltzmann s...
Ambedkar Dukkipati, M. Narasimha Murty, Shalabh Bh...