Sciweavers

WSC
1998
13 years 6 months ago
Using ACCESSIBILITY to Assess the Performance of Generalized Hill Climbing Algorithms
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
Sheldon H. Jacobson, Enver Yücesan