Heuristic Algorithms

In computer science, a heuristic algorithm, or simply a heuristic, is an algorithm that is able to produce an acceptable solution to a problem in many practical scenarios, but for which there is no formal proof of its correctness. Alternatively, it may be correct, but may not be proven to produce an optimal solution, or to use reasonable resources. Heuristics are typically used when there is no known method to find an optimal solution, under the given constraints (of time, space etc.) or at all.

Graphical Ontology Browser

  • Click on a node to jump to the content of that node
  • Pan to see the rest of the graph
  • Scroll the mousewheel up and down to zoom in and out
  • Rearrange the nodes in the graph by dragging a node to a different position

References

IntroductionPlanning/Decision ContextPlanning And Spatial Decision ProcessSpatial Planning And Decision Problem TypesMethods And Techniques
methods and techniques; methodology
TechnologyData And Domain KnowledgePeople And ParticipationResources