636 search results - page 28 / 128 » Measuring Complexity of Intelligent Machines |
SRDS
2000
IEEE
15 years 2 months ago
2000
IEEE
Validation of distributed systems using fault injection is difficult because of their inherent complexity, lack of a global clock, and lack of an easily accessible notion of a gl...
ILP
2003
Springer
15 years 2 months ago
2003
Springer
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
55
Voted
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Automatically assessing the value of bioavailability from the chemical structure of a molecule is a very important issue in biomedicine and pharmacology. In this paper, we present...
PLDI
2009
ACM
15 years 4 months ago
2009
ACM
Modern programs frequently employ sophisticated modular designs. As a result, performance problems cannot be identified from costs attributed to routines in isolation; understand...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...