Word:

iterative deepening

iterative deepening - A graph search algorithm. When searching for a path through a graph from a given initial node to a solution node with some desired property, a depth-first search may never find a solution if it enters a cycle in the graph. We can either add an explicit check for cycles so that we never extend a path with a node it already contains or we can use iterative deepening where we explore all paths up to length (or "depth") N, starting from N=0 and increasing N until a solution is found.
Browse
ITE
Itelmen
item
item-by-item
itemisation
itemise
itemization
Itemize
Iter
Iterable
Iterance
Iterant
Iterate
Iterated Function System
Iteration
Iterative
-- iterative deepening --
iterator
Iternet
ITG
Ithaca
Ithaki
Ithunn
Ithyphallic
ITIL
Itineracy
Itinerancy
Itinerant
Itinerantly
itinerary
itinerate
itineration
ITLB
Definitions Index: # A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

About this site and copyright information - Online Dictionary Home - Privacy Policy