58 search results - page 4 / 12 » A Modular Approach for Model-Based Dependability Evaluation ... |
GECCO
2007
Springer
13 years 12 months ago
2007
Springer
Recent work has provided functions that can be used to prove a principled distinction between the capabilities of mutation-based and crossover-based algorithms. However, prior fun...
LPAR
2004
Springer
13 years 11 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
IAT
2009
IEEE
13 years 9 months ago
2009
IEEE
Abstract--This paper is focusing on exact Bayesian reasoning in systems of agents, which represent weakly coupled processing modules supporting collaborative inference through mess...
AAAI
1997
13 years 7 months ago
1997
Often a rule-based system is tested by checking its performance on a number of test cases with known solutions, modifying the system until it gives the correct results for all or ...
ICDE
1999
IEEE
14 years 7 months ago
1999
IEEE
Increasingly, for extensibility and performance, specialpurpose application code is being integrated with database system code. Such application code has direct access to database...