Ostrich algorithm
In computer science, the ostrich algorithm is a strategy of ignoring potential problems on the basis that they may be exceedingly rare. It is named after the ostrich effect which is defined as "to stick one's head in the sand and pretend there is no problem". It is used when it is more cost-effective to allow the problem to occur than to attempt its prevention.
Ostrich algorithm - Wikipedia Jump to content From Wikipedia, the free encyclopedia Strategy in computer science In computer science , the ostrich algorithm is a strategy of ignoring potential problems on the basis that they may be exceedingly rare. It is named after the ostrich effect which is defined as "to stick one's head in the sand and pretend there is no problem". It is used when it appears the situation may be more cost-effectively managed by allowing the problem to continue to occur rather than to attempt its prevention. Use with deadlocks [ edit ] This approach may be used in dealing
Explore this link on the map →related reading
- Banker's algorithm - Wikipediaen.wikipedia.org
- Ostrich Effect - The Decision Labthedecisionlab.com
- Visualizing Algorithmsbost.ocks.org
- Role Of Algorithmsmatklad.github.io
- Non-blocking algorithm - Wikipediaen.wikipedia.org
- Algorithm - Wikipediaen.wikipedia.org
- Reddit - Please wait for verificationreddit.com
- Algorithms for Modern Hardware - Algorithmicaen.algorithmica.org
- Dining philosophers problem - Wikipediaen.wikipedia.org
- The Writings of Leslie Lamportlamport.azurewebsites.net
- Tony Hoare has died | Hacker Newsnews.ycombinator.com
- What is Deadlock? - Definition from WhatIs.comtechtarget.com