Skip to search formSkip to main contentSkip to account menu

Quiescence search

Known as: Quiescence, Singular extension search 
Quiescence search is an algorithm typically used to evaluate minimax game trees in game-playing computer programs. It is a remedy for the horizon… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Detailed paleomagnetic studies have shown that the effusive Permian-Triassic traps in the Kotui River valley were formed as the… 
Highly Cited
2010
Highly Cited
2010
Accreting millisecond X-ray pulsars like IGR J00291+5934 are important because they can be used to test theories of pulsar… 
2008
2008
The Poznan-Oleśnica Fault Zone (P-OFZ) of central-west Poland is an over 150 km long, up to 10 km wide, and up to 200 m deep… 
Highly Cited
2002
Highly Cited
2002
The Mount Painter Region in the Northern Flinders Ranges, South Australia, contains a Mesoproterozoic gneissic complex… 
Highly Cited
2002
Highly Cited
2002
  • 2002
  • Corpus ID: 14405145
Highly Cited
2000
Highly Cited
2000
Low-mass X-ray transients hosting black hole candidates display on average a factor of ~100 larger swing in the minimum… 
Highly Cited
1986
Highly Cited
1986
We propose a methodology for the development of concurrent programs and apply it to an important class of problems: quiescence… 
Highly Cited
1980
Highly Cited
1980
The spatio-temporal variation of seismicity in the epicentral area of the 1952 Kern County California, earthquake (M_s = 7.7, 34… 
Highly Cited
1977
Highly Cited
1977
Highlight: Western wheatgrass (Agropyron smithii), blue grama (Bouteloua gracilis), and fourwing saltbush (Atriplex canescens…