### Some articles on *search graph, graph, search*:

Simulated Annealing - Selecting The Parameters - Diameter of The

... Simulated annealing may be modeled as a random walk on a

**Search Graph**... Simulated annealing may be modeled as a random walk on a

**search graph**, whose vertices are all possible states, and whose edges are the candidate moves ... provide a sufficiently short path on this**graph**from the initial state to any state which may be the global optimum ... In other words, the diameter of the**search graph**must be small.) In the traveling salesman example above, for instance, the**search**space for cities has = 2,432,902,008,176,640,000 (2.4 quintillion ...### Famous quotes containing the words graph and/or search:

“When producers want to know what the public wants, they *graph* it as curves. When they want to tell the public what to get, they say it in curves.”

—Marshall McLuhan (1911–1980)

“You may well ask how I expect to assert my privacy by resorting to the outrageous publicity of being one’s actual self on paper. There’s a possibility of it working if one chooses the terms, to wit: outshouting image-gimmick America through a quietly desperate *search* for self.”

—Kate Millett (b. 1934)

Main Site Subjects

Related Phrases

Related Words