Measuring problem-solving performance in AI

We can evaluate an algorithm’s performance in four ways in Artificial intelligence

  • Completeness
  • Optimality
  • Time complexity
  • Space complexity

Time and space complexity are always considered with respect to some measure of the problem difficulty. In theoretical computer science, the typical measure is the size of the state space graph, |V | + |E|, where V is the set of vertices (nodes) of the graph and E is the set of edges (links). This is appropriate when the graph is an explicit data structure that is input to the search program. (The map of Romania is an example of this.) In AI, the graph is often represented implicitly by the initial state, actions, and transition model and is frequently infinite

Leave a Comment