Log in

Relevant bibliographies by topics / Stopping

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Stopping'

Author: Grafiati

Published: 4 June 2021

Last updated: 19 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Stopping.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Stopping"

1

Garavan, Hugh. "Stopping to Think About Stopping." Biological Psychiatry: Cognitive Neuroscience and Neuroimaging 5, no. 5 (May 2020): 476–77. http://dx.doi.org/10.1016/j.bpsc.2020.03.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Maynard, G., S. Mabong, and K. Katsonis. "Photons emission and charge-exchange contributions to the energy loss of swift heavy ions in dense matter." Laser and Particle Beams 14, no. 4 (December 1996): 587–98. http://dx.doi.org/10.1017/s0263034600010302.

Full text

Abstract:

In this paper we determine the inelastic contribution to the energy losses by swift heavy ions in dense matter. At equilibrium, the charge transfer stopping is determined by a simple energy balance and the excitation stopping is determined by the photons emission. Using an average atom model, we determine the density influence on these inelastic stoppings.

APA, Harvard, Vancouver, ISO, and other styles

3

Thomison, John B. "STOPPING." Southern Medical Journal 82, no. 8 (August 1989): 941–42. http://dx.doi.org/10.1097/00007611-198908000-00002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Nikeghbali, Ashkan. "Non-stopping times and stopping theorems." Stochastic Processes and their Applications 117, no. 4 (April 2007): 457–75. http://dx.doi.org/10.1016/j.spa.2006.06.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bao, Wenqing, Xianyi Wu, and Xian Zhou. "Optimal stopping problems with restricted stopping times." Journal of Industrial & Management Optimization 13, no. 1 (2017): 399–411. http://dx.doi.org/10.3934/jimo.2016023.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

YANI, SUTRI, and LIZA PUTRI. "PENERAPAN TERAPI THOUGHT STOPPING UNTUK MENGATASI REMAJA PECANDU MINUMAN KERAS." Journal of Nursing and Public Health 8, no. 2 (November 7, 2020): 87–90. http://dx.doi.org/10.37676/jnph.v8i2.1191.

Full text

Abstract:

Pendahuluan: Minuman Keras banyak menimbulkan masalah. Pemerintah dan masyarakat harus bekerjasama untuk membuat larangan tentang minuman keras. Khususnya para remaja, sehingga dapat mengurangi penyimpangan pada remaja salah satunya minuman keras dengan menerapkan terapi thought stoppping. Thought stopping adalah suatu teknik yang digunakan untuk menyembuhkan pemikiran negatif yang merusak diri dengan mengatakan “STOP” dan mengganti negatif menjadi pikiran positif. Metode: Penelitian ini menggunakan quantitative dengan design quasai eksperemet. Sampel dalam penelitian ini adalah Remaja pecandu minuman keras. Hasil: Hasil didapatkan nilai P value = 0,001, yang bearti terdapat pengaruh yang signifikan pemberian terapi thought stopping untuk mengatasi frekuensi remaja minum-minuman keras.Kesimpulan: Hasil penelitian menunjukan terapi thought stopping menghentikan pikiran negatif sangat efektif dalam merubah proses pikir pada remaja pecandu minuman keras.

APA, Harvard, Vancouver, ISO, and other styles

7

Seppa, Nathan. "Stopping Alzheimer's." Science News 166, no. 6 (August 7, 2004): 83. http://dx.doi.org/10.2307/4015559.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Percival, Jennifer. "Starting stopping." Nursing Standard 9, no. 24 (March 8, 1995): 18–20. http://dx.doi.org/10.7748/ns.9.24.18.s37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kruglov, V. M. "Stopping times." Moscow University Computational Mathematics and Cybernetics 35, no. 2 (May 20, 2011): 57–62. http://dx.doi.org/10.3103/s027864191102004x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Weston, John. "Stopping Short." Foreign Affairs 79, no. 4 (2000): 166. http://dx.doi.org/10.2307/20049874.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Stopping"

1

Garris, Bill R., and Mary M. Klug. "Stopping Internet Addiction." Digital Commons @ East Tennessee State University, 2018. https://dc.etsu.edu/etsu-works/3148.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Thakrar, Bharatkumar. "Non-commutative stopping times." Thesis, Imperial College London, 1988. http://hdl.handle.net/10044/1/47273.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Vaicenavicius, Juozas. "Optimal Stopping under Drift Uncertainty." Licentiate thesis, Uppsala universitet, Analys och sannolikhetsteori, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-251743.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Foncea, Araneda Patricio Tomás. "Optimal stopping in mechanism design." Tesis, Universidad de Chile, 2017. http://repositorio.uchile.cl/handle/2250/146675.

Full text

Abstract:

Magíster en Gestión de Operaciones. Ingeniero Civil Matemático
En este trabajo estudiamos un par de problemas de la teoría de paradas óptimas, y mostramos cómo aplicar estos resultados en el diseño de mecanismos. Consideramos dos versiones modificadas de la famosa desigualdad del profeta [10, 16, 17]: una no-adaptativa donde la regla de parada debe ser decidida de antemano, y una adaptativa --- que corresponde a la configuración clásica de la desigualdad del profeta ---, pero en el caso restringido cuando las distribuciones de las variables aleatorias están idénticamente distribuidas [13]. Para la primera situación, encontramos un factor de garantía para la regla de parada con respecto al máximo esperado de la secuencia de variables aleatorias y demostramos que es la mejor posible; para el segundo, probamos que una conjetura sobre cuál es el mejor factor posible es verdadera [14]. Cerramos esta tesis extendiendo estos resultados para resolver el problema de un vendedor que enfrenta a muchos compradores potenciales y debe diseñar una subasta secuencial para maximizar sus ingresos. El tipo de mecanismos que consideramos para estudiar este problema de pricing son los mecanismos posted price, y los resultados que obtenemos toman la forma de factores de aproximación con respecto al valor de la subasta óptima [19].
In this work we study a pair of problems in optimal stopping theory, and show how to apply these results in mechanism design. We consider two modified versions of the famous prophet inequality [10, 16, 17]: a non-adaptive where the stop rule must be decided beforehand, and an adaptive one --- which corresponds to the classical prophet inequality setting ---, but when the distributions of the random variables are identical [13]. For the first set-up, we find a new factor guarantee with respect to the expected maximum of the random variables sequence and prove it is the best possible; for the second, we prove that a conjecture about the best possible factor achievable is true [14]. We close this dissertation by extending these results to solve the problem of a seller that faces many potential buyers and must design a sequential auction in order to maximize its revenue. The type of mechanisms we consider to study this pricing problem are the posted price mechanisms, and the results we get are in the form of approximation factors guarantees with respect to the optimal auction [19].
Este trabajo ha sido parcialmente financiado por Conicyt y el Núcleo Milenio Información y Coordinación en Redes

APA, Harvard, Vancouver, ISO, and other styles

5

Sun, Jian S. M. Massachusetts Institute of Technology. "Reputation with stopping time decision." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/129088.

Full text

Abstract:

Thesis: S.M. in Management Research, Massachusetts Institute of Technology, Sloan School of Management, September, 2020
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 27-28).
This paper studies a long run relationship between two players while one player has reputation concern and the other player's decision is a stopping time. The equilibrium structure depends on the value of the long run relationship: when the value of the relationship is low, a simple threshold equilibrium is the unique equilibrium; when the value becomes higher, a probationary period endogenously arises when reputation is in an intermediate region. Reputation concern also has discipline effect, moral hazard problem is mitigated when player's reputation becomes worse, and the discipline effect is dominating when reputation is sufficiently bad.
by Jian Sun.
S.M. in Management Research
S.M.inManagementResearch Massachusetts Institute of Technology, Sloan School of Management

APA, Harvard, Vancouver, ISO, and other styles

6

Spachis, Alexandra Sofia Evangelia. "Optimal stopping for portfolio management." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/33134.

Full text

Abstract:

This thesis is concerned with the modelling and algorithmic development of a Stopping Rule Problem (SRP) in the area of Portfolio Management. More specifically, the objective is to provide an exit strategy for an invested portfolio containing one or more assets. The exit strategy aims to protect gains in addition to limiting losses. The thesis focuses on the investment/disinvestment in the portfolio and is not concerned with the composition of the portfolio. A new Finite Horizon SRP, referred to as the Portfolio Management Problem (PMP), has been proposed that allows future scenarios to be considered in the optimisation of the exit time. The PMP aims at maximizing the expected reward of a Portfolio Manager (PM) through an optimal policy. A Dynamic Programming approach is proposed and the DP algorithm developed is capable of solving real-life problems for short- and long-term trades. The applicability of the PMP is limited to cases where no constraints have been imposed by the PM. In view of adding more realism into the model, a Stop Loss and Target Return has been encapsulated in the formulation of the PMP model and thus, in the optimisation of the exit time. The impact of the model with enhanced managerial capabilities, is a better control of the maximum drawdown which restricts the risk of investment, influencing positively metrics of performance. An efficient tradeoff between computational time and size of problem solved has been developed. The final part of this thesis focuses on a PMP which takes into consideration in a dynamic way the new market information for the determination of the optimal policy for assets exhibiting Mean-reversion (MR). This has been achieved through the insertion of a MR Rule specifically developed for the PMP which quantifies future tendencies of the asset prices based on its varying average. An algorithm dealing with the further additional memory requirements has been developed, capable of solving problems of size identical to the original PMP.

APA, Harvard, Vancouver, ISO, and other styles

7

Qiang, Li. "Pair Trading in Optimal Stopping Theory." Thesis, Uppsala University, Department of Mathematics, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-119421.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Taghavi, Ehsan, Fredrik Lindsten, Lennart Svensson, and Thomas B. Schön. "Adaptive stopping for fast particle smoothing." Linköpings universitet, Reglerteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-93461.

Full text

Abstract:

Particle smoothing is useful for offline state inference and parameter learning in nonlinear/non-Gaussian state-space models. However, many particle smoothers, such as the popular forward filter/backward simulator (FFBS), are plagued by a quadratic computational complexity in the number of particles. One approach to tackle this issue is to use rejection-sampling-based FFBS (RS-FFBS), which asymptotically reaches linear complexity. In practice, however, the constants can be quite large and the actual gain in computational time limited. In this contribution, we develop a hybrid method, governed by an adaptive stopping rule, in order to exploit the benefits, but avoid the drawbacks, of RS-FFBS. The resulting particle smoother is shown in a simulation study to be considerably more computationally efficient than both FFBS and RS-FFBS.
CNDM
CADICS

APA, Harvard, Vancouver, ISO, and other styles

9

Jones, Martin Lee. "Universal constants in optimal stopping theory." Diss., Georgia Institute of Technology, 1989. http://hdl.handle.net/1853/30092.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Daher, Ali. "Local stopping rules for gossip algorithms." Thesis, McGill University, 2011. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=103676.

Full text

Abstract:

The increasing importance of gossip algorithms is beyond dispute. Randomized gossip algorithms are attractive for collaborative in-network processing and aggregation because they are fully asynchronous, they require no overhead to establish and form routes, and they do not create any bottleneck or single point of failure. All nodes maintain independent asynchronous random clocks, and when a node's clock ticks it initiates a new round of gossip: it randomly selects a neighboring node, exchanges information with the neighbor, and the two nodes compute local updates. When these updates involve averaging the values of the two nodes that gossiped, the algorithm solves the widely-studied average consensus problem which is the focus in this thesis. To analyze the energy-accuracy tradeoff for randomized gossip, previous studies have focused on analyzing the worst-case number of transmissions required to reach a specified level of accuracy, over all initial conditions. In a practical implementation, though, rather than always running for the worst-case number of transmissions, one would like to fix a desired level of accuracy in advance and have the algorithm run for as many iterations as are necessary to achieve this accuracy with high probability. This thesis describes and analyzes an implicit local stopping rule with theoretical performance guarantees. After a node's estimate has not changed significantly for a number of consecutive iterations, it ceases to initiate new gossip rounds. To avoid stopping early and biasing the computation, stopped nodes still participate in gossip rounds when contacted by a neighbor. We provide theoretical guarantees on the final accuracy of the estimates across the network as a function of the algorithm parameters. Through simulation, we show that applying the local stopping rule leads to significant savings in the number of transmissions for many relevant initial conditions. In practical applications one often wishes to track a time-varying average, rather than compute a static quantity. In this scenario, we illustrate that our local stopping rule can be viewed as an event-triggered gossip algorithm. Simulations illustrate the benefits of the proposed approach.
L'importance croissante des algorithmes décentralisées de passage de messages est incontestable. Ces algorithmes sont attrayants pour le traitement d'information dans les réseaux de collaboration et l'agrégation parce qu'ils sont totalement asynchrones, ils ne nécessitent pas de frais généraux pour établir et former les routes, il n'exige pas de coordination centralisée et conséquemment ils ne créent pas de goulot d'étranglement ou de point de défaillance unique dans le réseau. Tous les noeuds maintiennent indépendamment des horloges asynchrone, lorsque l'horloge d'un noeud tiques, le noeud initie un nouveau cycle de passage de messages: il sélectionne aléatoirement un noeud voisin, échange des informations avec le voisin, et les deux noeuds calculent et mettent a jour leur variables. Lorsque ces mises à jour incluent le calcul de la moyenne des valeurs des deux noeuds, l'algorithme permet de résoudre le problème du calcul du consensus moyen qui est le sujet de discussion du présent document. Afin d'analyser le compromis entre l'énergie de transmission et la précision de la valeur du consensus, de études antérieures ont porté sur l'analyse du nombre basé sur le pire des cas pour atteindre un niveau de précision. Dans une mise en oeuvre pratique, cependant, au lieu d'être toujours en cours d'exécution du nombre de pire des cas de transmissions, on voudrait fixer un niveau de précision désiré à l'avance et l'algorithme exécutera conséquemment un nombre d'itérations nécessaires pour obtenir cette précision avec haute probabilité. Ce document décrit et analyse une règle d'arrêt implicite locale avec garanties de performance théorique. Quand un noeud estime qu'il n'a pas changé de manière significative pour un certain nombre d'itérations consécutives, il cesse l'échange de donnée la prochaine fois que son horloge tique. Nous soulignons ici que pour éviter l'arrêt précoce de l'algorithme, le noeud participe au passage de message lorsqu'il est contacté par un voisin. Nous offrons des garanties théoriques sur la précision finale des estimations sur le réseau en fonction des paramètres de l'algorithme. En se basant sur les simulations, nous montrons que l'application de la règle d'arrêt local conduit à des économies importantes dans le nombre de transmissions pour de nombreuses conditions initiales. Dans les applications pratiques on souhaite souvent suivre une moyenne variante dans le temps, au lieu de calculer une quantité statique. Dans cette thèse nous développerons des algorithmes de passage de messages déclenchés par le événements pour suivre les signaux variables dans le temps. Des simulations illustrent les avantages de l'approche proposée.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Stopping"

1

Simson, Garfinkel, ed. Stopping spam. Sebastopol, Calif: O'Reilly, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Spivet, Bonnie. Stopping cyberbullying. New York: PowerKids Press, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Stopping pollution. Chicago, Ill: Heinemann Library, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Without stopping. London: Hamish Hamilton, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Stead, Martine. Stopping smoking. London: Ealing Health Authority, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

John, Philpott, and Employment Institute, eds. Stopping unemployment. London: Employment Institute, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Catherine, Chambers. Stopping pollution. London: Heinemann Library, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Stopping spyware. [S.l.]: Addison Wesley, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Catherine, Chambers. Stopping pollution. Oxford: Heinemann Library, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bus stopping. [Singapore]: Blacksteps, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Stopping"

1

Sigmund, Peter. "Stopping." In Springer Series in Solid-State Sciences, 149–95. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-05564-0_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Brady, Richard. "Stopping." In Walking the Teacher’s Path with Mindfulness, 87–88. New York, NY : Routledge, 2021. | Series: Eye on education: Routledge, 2021. http://dx.doi.org/10.4324/9781003156369-19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Scott, Ian C., James B. Galloway, and David L. Scott. "Stopping Treatments." In Inflammatory Arthritis in Clinical Practice, 173–81. London: Springer London, 2015. http://dx.doi.org/10.1007/978-1-4471-6648-1_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Gooch, Jan W. "Hard Stopping." In Encyclopedic Dictionary of Polymers, 357. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4419-6247-8_5801.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sigmund, Peter. "Nuclear Stopping." In Springer Tracts in Modern Physics, 85–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-44471-8_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Robbins, Herbert. "Optimal Stopping." In Herbert Robbins Selected Papers, 453–63. New York, NY: Springer New York, 1985. http://dx.doi.org/10.1007/978-1-4612-5110-1_41.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chung, K. L. "Optimal Stopping." In Mathematical Finance and Probability, 257–75. Basel: Birkhäuser Basel, 2003. http://dx.doi.org/10.1007/978-3-0348-8041-1_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Nahler, Gerhard. "stopping rules." In Dictionary of Pharmaceutical Medicine, 175. Vienna: Springer Vienna, 2009. http://dx.doi.org/10.1007/978-3-211-89836-9_1336.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Wogan, Peter. "Stopping Time." In Corner-Store Dreams and the 2008 Financial Crisis, 137–43. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-52264-7_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

de Saporta, Benoîte, François Dufour, and Huilong Zhang. "Optimal Stopping." In Numerical Methods for Simulation and Optimization of Piecewise Deterministic Markov Processes, 123–63. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2015. http://dx.doi.org/10.1002/9781119145066.ch7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Stopping"

1

Abdel-Ghaffar, Khaled A. S., and Jos H. Weber. "Generalized Stopping Sets and Stopping Redundancy." In 2007 Information Theory and Applications Workshop. IEEE, 2007. http://dx.doi.org/10.1109/ita.2007.4357610.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Strickland, Daniel, and Susan V. Vrbsky. "Stopping traffic." In the 35th Annual Southeast Regional Conference. New York, New York, USA: ACM Press, 1997. http://dx.doi.org/10.1145/2817460.2817527.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Goodman, Joshua T., and Robert Rounthwaite. "Stopping outgoing spam." In the 5th ACM conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/988772.988779.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Toms, Elaine G., and Luanne Freund. "Predicting stopping behaviour." In the 32nd international ACM SIGIR conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1571941.1572110.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Mnih, Volodymyr, Csaba Szepesvári, and Jean-Yves Audibert. "Empirical Bernstein stopping." In the 25th international conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1390156.1390241.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ma, Justin, Geoffrey M. Voelker, and Stefan Savage. "Self-stopping worms." In the 2005 ACM workshop. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1103626.1103630.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Cummings, Mary Anne Clare, Rolland P. Johnson, Charles Ankenbrandt, and Katsuya Yonehara. "Stopping muon beams." In 2007 IEEE Particle Accelerator Conference (PAC). IEEE, 2007. http://dx.doi.org/10.1109/pac.2007.4440625.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Maxwell, David, Leif Azzopardi, Kalervo Järvelin, and Heikki Keskustalo. "Searching and Stopping." In CIKM'15: 24th ACM International Conference on Information and Knowledge Management. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2806416.2806476.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Schwartz, M., and A. Vardy. "On the stopping distance and the stopping redundancy of codes." In Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. IEEE, 2005. http://dx.doi.org/10.1109/isit.2005.1523483.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Peaty, Simon. "Maritime Vessel Stopping Less than Lethal Means of Stopping Waterborne Vessels." In Proceedings 40th Annual 2006 International Carnahan Conference on Security Technology. IEEE, 2006. http://dx.doi.org/10.1109/ccst.2006.313461.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Stopping"

1

Arvanitaki, A., S. Dimopoulos, A. Pierce, S. Rajendran, and J. Wacker. Stopping Gluinos. Office of Scientific and Technical Information (OSTI), June 2005. http://dx.doi.org/10.2172/881144.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Fermi Research Alliance, LLC. Stopping muon beams. Office of Scientific and Technical Information (OSTI), June 2007. http://dx.doi.org/10.2172/1605580.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Singleton, Jr., Robert. Stopping Power for Degenerate Electrons. Office of Scientific and Technical Information (OSTI), May 2016. http://dx.doi.org/10.2172/1253546.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Dornbusch, Rudiger, and Stanley Fischer. Stopping Hyperinflations Past and Present. Cambridge, MA: National Bureau of Economic Research, January 1986. http://dx.doi.org/10.3386/w1810.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

ARMY SAFETY CENTER FORT RUCKER AL. Stopping Accidents in Maintenance Operations. Fort Belvoir, VA: Defense Technical Information Center, February 1991. http://dx.doi.org/10.21236/ada373177.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bather, John. Stopping Rules and Observed Significance Levels. Fort Belvoir, VA: Defense Technical Information Center, September 1987. http://dx.doi.org/10.21236/ada190320.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Jonathan Lucas Kwiyega, Jonathan Lucas Kwiyega. Stopping Illegal Lion Killing: Are we succeeding? Experiment, October 2016. http://dx.doi.org/10.18258/8143.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bather, John. Stopping Rules and Ordered Families of Distributions. Fort Belvoir, VA: Defense Technical Information Center, December 1987. http://dx.doi.org/10.21236/ada192843.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Inokuti, Mitio. Stopping power, its meaning, and its general characteristics. Office of Scientific and Technical Information (OSTI), June 1995. http://dx.doi.org/10.2172/71685.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Alvarez, Fernando, Katarína Borovičková, and Robert Shimer. Decomposing Duration Dependence in a Stopping Time Model. Cambridge, MA: National Bureau of Economic Research, April 2016. http://dx.doi.org/10.3386/w22188.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!