NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3752
  • 1249
  • 523
  • 489
  • 323
  • 323
  • 323
  • 323
  • 323
  • 314
  • 101
  • 98
  • 60
  • 13
  • 12
  • Tagged with
  • 7317
  • 7317
  • 773
  • 628
  • 621
  • 551
  • 500
  • 487
  • 484
  • 466
  • 392
  • 388
  • 354
  • 353
  • 346
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 311 to 320 of 7317 (0.065 seconds)

Spelling suggestions: "subject:"amathematical models."" "subject:"dmathematical models.""

311

FIXED BED REACTOR DYNAMICS

Heibel, John Thomas, 1943- January 1969 (has links)
No description available.
312

A NONLINEAR MODEL FOR GLYCOLYTIC OSCILLATIONS IN YEAST EXTRACTS

Singh, Ajeet, 1942- January 1977 (has links)
No description available.
Glycolysis -- Mathematical models.
313

COLLISION COMPLEXES OF INTERMEDIATE LIFETIME (THE CROSSED MOLECULAR-BEAM REACTIONS OF BARIUM WITH POTASSIUM-CHLORIDE, POTASSIUM-IODIDE, CESIUM-CHLORIDE AND CESIUM-IODIDE)

Khandelwal, Suresh Chandra, 1940- January 1974 (has links)
No description available.
314

AN ANALYSIS OF CAPICITY EXPANSION PROBLEMS WITH BACKORDERS AND STOCHASTIC DEMAND

Huang, Chih-yüan January 1987 (has links)
We show that, under certain conditions, instead of solving stochastic capacity expansion problems, we will obtain the same optimal solution by solving deterministic equivalent problems. Since only the first decision must be implemented immediately, knowing the optimal first decision is nearly as good as knowing the entire optimal sequences. Hence if we can solve the problem with 'big enough' finite horizon such that the first decision remains optimal for longer than this finite horizon, then we identify the 'big enough' finite horizon as forecast horizon. The forward dynamic programming recursion can be used to solve a finite horizon problem. An efficient forward algorithm has been developed to obtain the first optimal decision and forecast horizon. A heuristic algorithm also has been derived to prove an initial decision is within known error bound of the optimal first decision. Several examples are examined to investigate how a decision will be affected by randomness. (Abstract shortened with permission of author.)
315

Numerical study of tsunami wave propagation and runup on islands

Chen, Jack January 2012 (has links)
No description available.
620
Tsunamis--Mathematical models
316

Models of the early universe

Dechant, Pierre-Philippe January 2011 (has links)
No description available.
530
Cosmology--Mathematical models
317

A closed loop technique for aircraft performance optimization

Berry, Robert L. January 1970 (has links)
No description available.
318

A mathematical study of particle-size distributions produced in a continuous grinding circuit

Durando, Antonio Raffaele, 1944- January 1971 (has links)
No description available.
Ore-dressing -- Mathematical models.
319

An optimal operating policy for a variable channel queue

Ramsey, Charles Neil, 1944- January 1969 (has links)
No description available.
Queuing theory -- Mathematical models.
320

Models for the analysis and control of epidemics

Steinwachs, Donald M. January 1970 (has links)
No description available.
Epidemiology -- Mathematical models.

Page generated in 0.0702 seconds