KonkurStudy
همه کارت‌ها

Backtracking vs. Branch and Bound in State-Space Search

Backtracking suits feasibility/constraint-satisfaction searches; Branch and Bound adds a cost bound for optimization.

کارت مفهوم کنکور ارشد علوم کامپیوتر