Hasil Pencarian  ::  Simpan CSV :: Kembali

"Combinatorial data analysis (CDA) refers to a wide class of methods for the study of relevant data sets in which the arrangement of a collection of objects is absolutely central. The focus of this monograph is on the identification of arrangements, which are then further restricted to where the combinatorial search is carried out by a recursive optimization process based on the general principles of dynamic programming (DP). The authors provide a comprehensive and self-contained review delineating a very general DP paradigm or schema that can serve two functions. First, the paradigm can be applied in various special forms to encompass all previously proposed applications suggested in the classification literature. Second, the paradigm can lead directly to many more novel uses. An appendix is included as a user's manual for a collection of programs available as freeware. The incorporation of a wide variety of CDA tasks under one common optimization framework based on DP is one of the book's strongest points. The authors include verifiably optimal solutions to nontrivially sized problems over the array of data analysis tasks discussed."

"This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization."

"Based on the results of over 10 years of research and development by the authors, this book presents a broad cross section of dynamic programming (DP) techniques applied to the optimization of dynamical systems. The main goal of the research effort was to develop a robust path planning/trajectory optimization tool that did not require an initial guess. The goal was partially met with a combination of DP and homotopy algorithms. DP algorithms are presented here with a theoretical development, and their successful application to variety of practical engineering problems is emphasized."

"This monograph provides an introduction to the state of the art of the probability theory that is most directly applicable to combinatorial optimization. The questions that receive the most attention are those that deal with discrete optimization problems for points in Euclidean space, such as the minimum spanning tree, the traveling-salesman tour, and minimal-length matchings. Still, there are several nongeometric optimization problems that receive full treatment, and these include the problems of the longest common subsequence and the longest increasing subsequence. The philosophy that guides the exposition is that analysis of concrete problems is the most effective way to explain even the most general methods or abstract principles."

"The 26 revised full papers presented were carefully reviewed and selected from 64 submissions. The papers are focused on both theoretical and practical, application-oriented issues in combinatorial optimization and feature current research with a special focus on inference and relaxation methods, integration methods, modeling methods, innovative applications of CP/AI/OR techniques, and implementation of CP/AI/OR techniques and optimization systems."

"[Kendaraan listrik memanfaatkan baterai sebagai sumber daya utama penggeraknya. Penting untuk mengetahui kondisi parameter ? parameter baterai seperti tegangan dan arus agar diketahui kemampuan baterai sebagai sumber daya kendaraan listrik. Metode simulasi matematis dapat dilakukan untuk mengetahui nilai parameter ? parameter baterai. Simulasi menggunakan beberapa set baterai yang dioperasikan secara serentak dan bergiliran. Hasil simulasi menunjukkan bahwa jumlah baterai yang dibutuhkan bergantung dari massa kendaraan, kecepatan, perubahan kecepatan dan perkiraan waktu operasional kendaraan. Baterai yang dioperasikan secara serentak menyisakan kapasitas sebesar 24,48% dan baterai yang dioperasikan secara bergiliran menyisakan kapastias sebesar 11,71% untuk menempuh jarak 157,5 Km.;Electric vehicles use battery as a main resource to be a prime mover. Knowing the condition of battery parameters such as current and voltage in order to discover battery power as a main resource of electric vehicle. Mathematical simulation methode might be used to discover parameters that can actuate electric vehicle. The simulation use some sets of battery which are operated simultaneously and rotationally. The result of simulation stated that number of needed battery rely on vehicle mass, velocity, velocity shift, and estimated operational time of vehicle. Battery that is operated silmutaneously have remaining capacity 24.48 % and battery that is operated rotationally have remaining capacity 11.71% for a distance 157.5 Km.;Electric vehicles use battery as a main resource to be a prime mover. Knowing the condition of battery parameters such as current and voltage in order to discover battery power as a main resource of electric vehicle. Mathematical simulation methode might be used to discover parameters that can actuate electric vehicle. The simulation use some sets of battery which are operated simultaneously and rotationally. The result of simulation stated that number of needed battery rely on vehicle mass, velocity, velocity shift, and estimated operational time of vehicle. Battery that is operated silmutaneously have remaining capacity 24.48 % and battery that is operated rotationally have remaining capacity 11.71% for a distance 157.5 Km., Electric vehicles use battery as a main resource to be a prime mover. Knowing the condition of battery parameters such as current and voltage in order to discover battery power as a main resource of electric vehicle. Mathematical simulation methode might be used to discover parameters that can actuate electric vehicle. The simulation use some sets of battery which are operated simultaneously and rotationally. The result of simulation stated that number of needed battery rely on vehicle mass, velocity, velocity shift, and estimated operational time of vehicle. Battery that is operated silmutaneously have remaining capacity 24.48 % and battery that is operated rotationally have remaining capacity 11.71% for a distance 157.5 Km.]"