491 search results - page 15 / 99 » Variance and Generalized Constraints for C |
IJCAI
1997
13 years 10 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
LCTRTS
2007
Springer
14 years 2 months ago
2007
Springer
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
FOCS
1997
IEEE
14 years 28 days ago
1997
IEEE
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
EKAW
2004
Springer
14 years 2 months ago
2004
Springer
Among the various tasks involved in building a Bayesian network for a real-life application, the task of eliciting all probabilities required is generally considered the most daunt...
CEC
2007
IEEE
13 years 9 months ago
2007
IEEE
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...