Hasil Pencarian  ::  Simpan CSV :: Kembali

"The just-in-time (JIT) production philosophy has enriched the classical scheduling theory with models that consider characteristics such as inventory costs, set-up times, lot sizing, or maintenance. This edited volume considers the specifics of just-in-time systems. It provides knowledge and insights on recent advances in scheduling theory where just-in-time aspects are considered. Contributions on models, theory, algorithms, and applications, that bring the theory up-to-date on the state-of-the-art of JIT systems are presented."

"This book is the most comprehensive review of high-resolution schemes based on the principle of Flux-Corrected Transport (FCT). Book describe the development of the classical FCT methodology for convection-dominated transport problems, while the design philosophy behind modern FCT schemes is explained by S.T. Zalesak. The subsequent chapters present various improvements and generalizations proposed over the past three decades. In this new edition, recent results are integrated into existing chapters in order to describe significant advances since the publication of the first edition. Also, 3 new chapters were added in order to cover the following topics, algebraic flux correction for finite elements, iterative and linearized FCT schemes, TVD-like flux limiters, acceleration of explicit and implicit solvers, mesh adaptation, failsafe limiting for systems of conservation laws, flux-corrected interpolation (remapping), positivity preservation in RANS turbulence models, and the use of FCT as an implicit subgrid scale model for large eddy simulations."

"This research presents significant studies in experimental analysis or in the implementation, testing, and evaluation of algorithms for realistic environments and scenarios. The paper presentations address specific applied areas that present unique challenges in their underlying algorithmic problems as well as methodological issues and standards in the context of empirical research on algorithms and data structures. This proceedings collects extended versions of the 12 papers that were selected for presentation from a pool of 38 submissions."

"The Lanczos Method: Evolution and Application is divided into two distinct parts. The first part reviews the evolution of one of the most widely used numerical techniques in the industry. The development of the method, as it became more robust, is demonstrated through easy-to-understand algorithms. The second part contains industrial applications drawn from the author experience. These chapters provide a unique interaction between the numerical algorithms and their engineering applications."

"Many engineering and scientific problems in design, control, and parameter estimation can be formulated as optimization problems that are governed by partial differential equations (PDEs). The complexities of the PDEs and the requirement for rapid solution significant difficulties. A particularly challenging class of PDE-constrained optimization problems is characterized by the need for real-time solution, i.e., in time scales that are sufficiently rapid to support simulation-based decision making. Real-Time PDE-Constrained Optimization, the first book devoted to real-time optimization for systems governed by PDEs, focuses on new formulations, methods, and algorithms needed to facilitate real-time, PDE-constrained optimization. In addition to presenting state-of-the-art algorithms and formulations, the text illustrates these algorithms with a diverse set of applications that includes problems in the areas of aerodynamics, biology, fluid dynamics, medicine, chemical processes, homeland security, and structural dynamics. Despite difficulties, there is a pressing need to capitalize on continuing advances in computing power to develop optimization methods that will replace simple rule-based decision making with optimized decisions based on complex PDE simulations."

"We were very pleased to choose papers for presentation at the ACM-SIAM Symposium on Discrete Algorithms (SODA), which will take place in Manhattan in January 2009. A total of 550 short abstracts were submitted, later materializing into 458 submissions, of which 135 were selected. The program committee meeting was entirely electronic and the selection process took place in July and August 2008. The Best Student Paper award was given to the paper "Improved Bounds and New Techniques for Davenport?Schinzel Sequences and Their Generalizations" by Gabriel Nivasch, and the Best Paper award was given to the paper "Natural Algorithms" by Bernard Chazelle. There will be three invited presentations: one by Volker Strassen, as the recipient of the ACM-SIGACT 2008 Knuth prize; one by Michael Jordan; and one by Yuval Peres."

"This clearly structured and easy to read textbook explains the concepts and techniques required to write programs that can handle large amounts of data efficiently.Project-oriented and classroom-tested, the book presents a number of important algorithms supported by motivating examples that bring meaning to the problems faced by computer programmers. The idea of computational complexity is also introduced, demonstrating what can and cannot be computed efficiently so that the programmer can make informed judgements about the algorithms they use. The text assumes some basic experience in computer programming and familiarity in an object-oriented language, but not necessarily with Python.Topics and features:- Includes both introductory and advanced data structures and algorithms topics, with suggested chapter sequences for those respective courses provided in the preface- Provides learning goals, review questions and programming exercises in each chapter, as well as numerous illustrative examples- Offers downloadable programs and supplementary files at an associated website, with instructor materials available from the author- Presents a primer on Python for those coming from a different language background- Reviews the use of hashing in sets and maps, along with an examination of binary search trees and tree traversals, and material on depth first search of graphs- Discusses topics suitable for an advanced course, such as membership structures, heaps, balanced binary search trees, B-trees and heuristic search."

"This book is about how to use CGAL two-dimensional arrangements to solve problems. The authors first demonstrate the features of the arrangement package and related packages using small example programs. They then describe applications, i.e., complete standalone programs written on top of CGAL arrangements used to solve meaningful problems, for example, finding the minimum-area triangle defined by a set of points, planning the motion of a polygon translating among polygons in the plane, computing the offset polygon, finding the largest common point sets under approximate congruence, constructing the farthest-point Voronoi diagram, coordinating the motion of two discs moving among obstacles in the plane, and performing Boolean operations on curved polygons. "

"The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation and experimental evaluation of algorithms and data structures. The workshop was sponsored by SIAM, the Society for Industrial and Applied Mathematics, and SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory. The aim of ANALCO is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures."

"Contains 130 papers, which were selected based on originality, technical contribution, and relevance. Although the papers were not formally refereed, every attempt was made to verify the main claims. It is expected that most will appear in more complete form in scientific journals."