Package edu.columbia.cs.coms4701.search.informed.local.searchalgorithms

Local search algorithms.

See:
          Description

Interface Summary
AnnealingSchedule A simple function that returns a "temperature" controlling the probability of making suboptimal moves.
HillClimbingSearch<K extends AgentAction,S extends AgentState> Basic local search technique; in each step, the current node is replaced by the best neighbor.
SimulatedAnnealingSearch<K extends AgentAction,S extends AgentState> A version of stochastic hill climbing where some 'downhill' or non-best moves are allowed.
 

Package edu.columbia.cs.coms4701.search.informed.local.searchalgorithms Description

Local search algorithms.

Package Specification

Related Documentation

For overviews, tutorials, examples, guides, and tool documentation, please see: