Listing 1 - 7 of 7 |
Sort by
|
Choose an application
Choose an application
This monograph presents a radical rethinking of how elementary inferences should be made in statistics, implementing a comprehensive alternative to hypothesis testing in which the control of the probabilities of the errors is replaced by selecting the course of action (one of the available options) associated with the smallest expected loss. Its strength is that the inferences are responsive to the elicited or declared consequences of the erroneous decisions, and so they can be closely tailored to the client’s perspective, priorities, value judgments and other prior information, together with the uncertainty about them.
Linear programming. --- Mathematical statistics. --- Statistical decision. --- Mathematics --- Physical Sciences & Mathematics --- Mathematical Statistics --- Statistics. --- Statistical analysis --- Statistical data --- Statistical methods --- Statistical science --- Decision problems --- Statistics, general. --- Game theory --- Operations research --- Statistics --- Management science --- Econometrics --- Statistics .
Choose an application
"Provides a straightforward, bottom-up approach that assists the reader in obtaining a clear (but theoretically rigorous) understanding of Evolutionary Algorithms, with an emphasis on implementation rather than models"-- "This book is a clear and lucid presentation of Evolutionary Algorithms, with a straightforward, bottom-up approach that provides the reader with a firm grasp of the basic principles of EAs. Covering the theory, history, mathematics, and applications of evolutionary optimization algorithms, this timely and practical book offers lengthy examples, a companion website, MATLAB code, and a Solutions Manual--making it perfect for advanced undergraduates, graduates, and practicing engineers involved in engineering and computer science"--
Evolutionary computation --- Computer algorithms --- Biologically-inspired computing --- 681.3*G16 --- 681.3*G4 --- 519.8 --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Mathematical software: algorithm analysis; certification and testing; efficiency; portability; reliability and robustness; verification --- Operational research --- Evolutionary computation. --- Computer algorithms. --- Biologically-inspired computing. --- Mathematics --- Discrete Mathematics. --- 519.8 Operational research --- 681.3*G4 Mathematical software: algorithm analysis; certification and testing; efficiency; portability; reliability and robustness; verification --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Computation, Evolutionary --- Neural networks (Computer science) --- Algorithms --- Bio-inspired computing --- Natural computing --- Bionics --- Electronic data processing
Choose an application
Mathematical optimization --- Structural optimization --- Mathematical optimization. --- Structural optimization. --- linear programming --- gradient descent --- optimal control --- optimization --- process optimization --- Optimal structural design --- Optimization, Structural --- Optimization of structural systems --- Optimum design of structures --- Optimum structural design --- Optimum structures --- Structures, Optimum design of --- Structural design --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis
Choose an application
"The P-NP problem is the most important open problem in computer science, if not all of mathematics. The Golden Ticket provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem"--
Computer science --- NP-complete problems. --- Computer algorithms. --- Problems, NP-complete --- Computational complexity --- Algorithms --- NP-complete problems --- Computer algorithms --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- MATHEMATICS / Mathematical Analysis. --- MATHEMATICS / Linear Programming. --- MATHEMATICS / History & Philosophy. --- COMPUTERS / Programming / Algorithms. --- Facebook. --- Frenemy. --- Hamiltonian paths. --- Internet. --- Ketan Mulmuley. --- Leonid Levin. --- Martin Hellman. --- NP problem. --- NP problems. --- NP-complete. --- P versus NP problem. --- P versus NP. --- Richard Feynman. --- Steve Cook. --- Twitter. --- Urbana algorithm. --- Whitfield Diffie. --- academic work. --- algebraic geometry. --- algorithm. --- algorithms. --- approximation. --- big data. --- computational problems. --- computer science. --- computers. --- computing. --- cryptography. --- cryptosystem. --- database. --- decryption. --- digital computers. --- efficient algorithms. --- efficient computation. --- encryption. --- factoring. --- fast computers. --- graph isomorphism. --- heuristics. --- linear programming. --- mathematics. --- max-cut. --- network security. --- networking. --- new technologies. --- parallel computation. --- perebor. --- prime numbers. --- problems. --- programming. --- public-key cryptography. --- quantum computers. --- quantum computing. --- quantum cryptography. --- quantum mechanics. --- quantum physical systems. --- research community. --- secret messages. --- social networking data. --- solution. --- teleportation.
Choose an application
In this thesis, we study the regularity of optimal transport maps and its applications to the semi-geostrophic system. The first two chapters survey the known theory, in particular there is a self-contained proof of Brenier’ theorem on existence of optimal transport maps and of Caffarelli’s Theorem on Holder continuity of optimal maps. In the third and fourth chapter we start investigating Sobolev regularity of optimal transport maps, while in Chapter 5 we show how the above mentioned results allows to prove the existence of Eulerian solution to the semi-geostrophic equation. In Chapter 6 we prove partial regularity of optimal maps with respect to a generic cost functions (it is well known that in this case global regularity can not be expected). More precisely we show that if the target and source measure have smooth densities the optimal map is always smooth outside a closed set of measure zero.
Geometry, Differential -- Congresses. --- Metric spaces -- Congresses. --- Mathematics --- Civil & Environmental Engineering --- Engineering & Applied Sciences --- Physical Sciences & Mathematics --- Operations Research --- Calculus --- Transportation problems (Programming) --- Mathematical optimization. --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Transport problems (Programming) --- Mathematics. --- Calculus of variations. --- Calculus of Variations and Optimal Control; Optimization. --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Linear programming --- Isoperimetrical problems --- Variations, Calculus of --- Monge-Ampere equations. --- Differential equations, Partial.
Choose an application
This book shows the breadth and depth of stochastic programming applications. All the papers presented here involve optimization over the scenarios that represent possible future outcomes of the uncertainty problems. The applications, which were presented at the 12th International Conference on Stochastic Programming held in Halifax, Nova Scotia in August 2010, span the rich field of uses of these models. The finance papers discuss such diverse problems as longevity risk management of individual investors, personal financial planning, intertemporal surplus management, asset management with ben
Mathematical optimization --- Stochastic processes --- Stochastic programming --- Decision making --- Uncertainty --- Industrial applications --- Econometric models --- Mathematical optimization. --- Stochastic programming. --- Decision making. --- Uncertainty. --- Reasoning --- Deciding --- Decision (Psychology) --- Decision analysis --- Decision processes --- Making decisions --- Management --- Management decisions --- Choice (Psychology) --- Problem solving --- Random processes --- Probabilities --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Linear programming --- Industrial applications. --- Econometric models. --- E-books --- Mathematical optimization - Industrial applications --- Stochastic processes - Econometric models
Listing 1 - 7 of 7 |
Sort by
|