|
|
Showing 1 - 9 of
9 matches in All Departments
Coulson and Richardson's Chemical Engineering: Volume 3A: Chemical
and Biochemical Reactors and Reaction Engineering, Fourth Edition,
covers reactor design, flow modelling, gas-liquid and gas-solid
reactions and reactors.
The book presents concepts and equations of equilibrium
thermodynamics or thermostatics. Key features that distinguish this
book from others on chemical engineering thermodynamics are: a
mathematical treatment of the developments leading to the discovery
of the internal energy and entropy; a clear distinction between the
classical thermodynamics of Carnot, Clausius and Kelvin and the
thermostatics of Gibbs; an intensive/specific variable formalism
from which the extensive variable formalism is obtained as a
special case; a systematic method of obtaining the central
equations of thermostatics with the use of the implicit/inverse
function theorems and the chain rule. Please note: Taylor &
Francis does not sell or distribute the Hardback in India,
Pakistan, Nepal, Bhutan, Bangladesh and Sri Lanka.
This book constitutes the refereed proceedings of the 14th
International Scandinavian Symposium and Workshops on Algorithm
Theory, SWAT 2014, held in Copenhagen, Denmark, in July 2014. The
33 papers were carefully reviewed and selected from a total of 134
submissions. The papers present original research and cover a wide
range of topics in the field of design and analysis of algorithms
and data structures including but not limited to approximation
algorithms, parameterized algorithms, computational biology,
computational geometry and topology, distributed algorithms,
external-memory algorithms, exponential algorithms, graph
algorithms, online algorithms, optimization algorithms, randomized
algorithms, streaming algorithms, string algorithms, sublinear
algorithms and algorithmic game theory.
|
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011, Proceedings (Paperback)
Leslie Ann Goldberg, Klaus Jansen, R. Ravi, Jose D.P. Rolim
|
R1,543
Discovery Miles 15 430
|
Ships in 18 - 22 working days
|
This book constitutes the joint refereed proceedings of the 14th
International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems, APPROX 2011, and the 15th
International Workshop on Randomization and Computation, RANDOM
2011, held in Princeton, New Jersey, USA, in August 2011. The
volume presents 29 revised full papers of the APPROX 2011 workshop,
selected from 66 submissions, and 29 revised full papers of the
RANDOM 2011 workshop, selected from 64 submissions. They were
carefully reviewed and selected for inclusion in the book. In
addition two abstracts of invited talks are included. APPROX
focuses on algorithmic and complexity issues surrounding the
development of efficient approximate solutions to computationally
difficult problems. RANDOM is concerned with applications of
randomness to computational and combinatorial problems.
With the advent of approximation algorithms for NP-hard
combinatorial optimization problems, several techniques from exact
optimization such as the primal-dual method have proven their
staying power and versatility. This book describes a simple and
powerful method that is iterative in essence, and similarly useful
in a variety of settings for exact and approximate optimization.
The authors highlight the commonality and uses of this method to
prove a variety of classical polyhedral results on matchings,
trees, matroids, and flows. The presentation style is elementary
enough to be accessible to anyone with exposure to basic linear
algebra and graph theory, making the book suitable for introductory
courses in combinatorial optimization at the upper undergraduate
and beginning graduate levels. Discussions of advanced applications
illustrate their potential for future application in research in
approximation algorithms.
With the advent of approximation algorithms for NP-hard
combinatorial optimization problems, several techniques from exact
optimization such as the primal-dual method have proven their
staying power and versatility. This book describes a simple and
powerful method that is iterative in essence, and similarly useful
in a variety of settings for exact and approximate optimization.
The authors highlight the commonality and uses of this method to
prove a variety of classical polyhedral results on matchings,
trees, matroids, and flows. The presentation style is elementary
enough to be accessible to anyone with exposure to basic linear
algebra and graph theory, making the book suitable for introductory
courses in combinatorial optimization at the upper undergraduate
and beginning graduate levels. Discussions of advanced applications
illustrate their potential for future application in research in
approximation algorithms.
State-of-the-art analytic and quantitative methods for using big
data to craft effective real-time, dynamic customer-centric
marketing plans. The revolution in big data has enabled a
game-changing approach to marketing. The asynchronous and
continuous collection of customer data carries rich signals about
consumer preferences and consumption patterns. Use of this data can
make marketing adaptive, dynamic, and responsive to changes in
individual customer behavior. This book introduces state-of-the-art
analytic and quantitative methods for customer-centric marketing
(CCM). Rather than using a snapshot from the data to plot a single
campaign-centric marketing plan, these methods draw on cutting-edge
research in optimization and interactive marketing with the goal of
maximizing long-term profit from data collected over time. The aim
is to teach readers to apply optimization tools to derive
analytical solutions leading to customized, dynamic, proactive, and
real-time marketing decisions. The book develops the CCM framework
and illustrates it with four cases that span the life cycle of
marketing: pricing, win-back, cross-sales, and customer service
allocation. The text walks the reader through real-world examples
of applying the framework (supported by spreadsheet models
available online), then explains the key concepts: modeling
consumer choice; segmenting customers into latent classes based on
sensitivity; computing customer lifetime value (CLV); and dynamic
optimization. The reader then learns to incorporate the continuous
learning of customer preference into an adaptive feedback loop for
marketing decisions. The book can be used as a text for MBA
students or as a professional reference. This book is based on
joint research developed at Carnegie Mellon University when both
authors were on the faculty at the Tepper School of Business.
|
|