الصفحة 9
الصفحة 9
Algorithms - ESA 2006 ; 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings
This book constitutes the refereed proceedings of the 14th Annual European Symposium on Algorithms, ESA 2006, held in Zurich, Switzerland, in the context of the combined conference ALGO 2006. The book presents 70 revised full papers together with abstracts of 3 invited lectures. The papers address all current subjects in algorithmics, reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields.
Algorithms – ESA 2005 ; 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings
This volume contains the 75 contributed papers and the abstracts of the threeinvited lectures presented at the 13th Annual European Symposium on Algo-rithms (ESA 2005), held in Spain, 2005. respectively.Papers were solicited in all areas of algorithmic research, including but notlimited to algorithmic aspects of networks, approximation and on-line algo-rithms, computational biology, computational geometry, computational financeand algorithmic game theory, data structures, database and information re-trieval, external memory algorithms, graph algorithms, graph drawing, machinelearning, mobile computing, pattern matching and data compression, quantumcomputing, and randomized algorithms. The algorithms could be sequential,distributed, or parallel. Submissions were especially encouraged in the area ofmathematical programming and operations research, including combinatorialoptimization, integer programming, polyhedral combinatorics, and semidefiniteprogramming.Each extended abstract was submitted to one of the two tracks.
Algorithmic Learning in a Random World
This new monograph integrates mathematical theory and revealing experimental work. It demonstrates mathematically the validity of the reliability claimed by conformal predictors when they are applied to independent and identically distributed data, and it confirms experimentally that the accuracy is sufficient for many practical problems. Later chapters generalize these results to models called repetitive structures, which originate in the algorithmic theory of randomness and statistical physics. The approach is flexible enough to incorporate most existing methods of machine learning, including newer methods such as boosting and support vector machines and older methods such as nearest neighbors and the bootstrap.
Algorithmic Game Theory ; 1st International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings
This book constitutes the refereed proceedings of the First International Symposium on Algorithmic Game Theory, SAGT 2008, held in Paderborn, Germany, in April/May 2008.
Algorithmic Aspects in Information and Management ; 3rd International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings
This Book is intended for or- inal algorithmic research on immediate applications and/or fundamental pr- lems pertinent to information management and management science, broadly construed.
Algorithmic Aspects in Information and Management ; 14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings
This volume constitutes the proceedings of the 14th International Conference on Algorithmic Aspects in Information and Management, AAIM 2020, held in Jinhua, China in August 2020. The 39 full papers and 17 short papers presented were carefully reviewed and selected from 76 submissions. The papers deal with emerging important algorithmic problems with a focus on the fundamental background, theoretical technology development, and real-world applications associated with information and management analysis, modeling and data mining. Special considerations are given to algorithmic research that was motivated by real-world applications.
Algorithmes dapproximation
Le champ des algorithmes d'approximation est aujourd'hui l'un des domaines de recherche les plus actifs en informatique. Il allie la profondeur de la théorie mathématique aux promesses d'applications pratiques d'un intérêt considérable. La plupart des problèmes issus d'applications relevant de domaines aussi différents que la conception de circuits VLSI, la conception et la planification de réseaux, l'ordonnancement, la théorie des jeux, la biologie ou la théorie des nombres, sont des problèmes NP-difficiles. Leur résolution exacte demanderait des ressources informatiques inaccessibles et ne peut donc être envisagée. Pour faire face à cette situation, un grand nombre d'algorithmes proposant des solutions approchées à ces problèmes ont été développés.
Algorithm Theory - SWAT 2008 ; 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008. Proceedings
his book constitutes the refereed proceedings of the 11th Scandinavian Workshop on Algorithm Theory, SWAT 2008, held in Gothenborg, Sweden, in July 2008.
Algorithm Theory - SWAT 2006 ; 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings
This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The proceedings includes 36 revised full papers presented together with 3 invited papers, addressing issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, amd more.
Advances in intelligent computing ; Vol. 3645 ; International conference on intelligent computing, ICIC 2005, Hefei, China, August 23-26, 2005, Proceedings, Part II
This book constitutes the proceedings of the International Conference on Intelligent Computing (ICIC 2005), held in China, 215 papers were published in this book organized into 9 categories, Including Topics Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Image Processing and Computer Vision Pattern Recognition Evolutionary Biology
Advanced Linear Algebra
For the third edition, the author has added a new chapter on associative algebras that includes the well known characterizations of the finite-dimensional division algebras over the real field (a theorem of Frobenius) and over a finite field (Wedderburn's theorem); polished and refined some arguments (such as the discussion of reflexivity, the rational canonical form, best approximations and the definitions of tensor products); upgraded some proofs that were originally done only for finite-dimensional/rank cases; added new theorems, including the spectral mapping theorem; considerably expanded the reference section with over a hundred references to books on linear algebra.
Advanced Intelligent Computing Theories and Applications : With Aspects of Contemporary Intelligent Computing Techniques ; 3rd International Conference on Intelligent Computing, ICIC 2007 Qingdao, China, August 21-24, 2007 Proceedings
The International Conference on Intelligent Computing (ICIC) was formed to provide an annual forum dedicated to the emerging and challenging topics in artificial intelligence, machine learning, bioinformatics, and computational biology, etc. It aims to bring - gether researchers and practitioners from both academia and industry to share ideas, problems and solutions related to the multifaceted aspects of intelligent computing.This year, the conference concentrated mainly on the theories and methodologies as well as the emerging applications of intelligent computing. Its aim was to unify the picture of contemporary intelligent computing techniques as an integral concept that highlights the trends in advanced computational intelligence and bridges theoretical research with applications.
Advanced computational methods and geomechanics
Helps readers comprehensively grasp the intrinsic features of typical advanced computational methods. These methods are created in recent three decades for the understanding of the post-failure of geo-materials accompanied with discontinuous and finite deformation/dislocation, as well as the violent fluid-structure interaction accompanied with strong distortion of water surface. The strong points and weak points of the formalisms for governing equations, the discretization schemes, the nodal interpolation /approximation of field variables, and their connectivity (via support domains, covers, or enrichments), the basic algorithms, etc., are clarified.
Adaptive Scalarization Methods in Multiobjective Optimization
This book presents new adaptive solution methods for multiobjective optimization problems based on parameter dependent scalarizations. With the help of sensitivity results an adaptive parameter control is developed so that high-quality approximations of the efficient set are generated. These examinations are based on a general scalarization approach for arbitrary partial orderings defined by a closed pointed convex cone in the objective space. The application of the results to many other well-known scalarization methods is also presented. Background material of multiobjective optimization and scalarization approaches is concisely summarized at the beginning. The effectiveness of these new methods is demonstrated by test problems and a recent problem in intensity-modulated radiotherapy. The book concludes with a further application: a procedure for solving multiobjective bilevel optimization problems.
Abstraction, Reformulation, and Approximation ; 7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007, Proceedings
This volume contains the proceedings of SARA 2007, the seventh symposium, held at Whistler Village, British Columbia, Canada, July 18-21. Three distinguished speakers were invited to give keynote presentations, and their abstracts are included herein,It has been recognized since the inception of artificial intelligence that abstractions, problem reformulations and approximations (AR&A) are central to human common-sense reasoning and problem solving and to the ability of systems to reason effectively in complex domains.AR&A techniques have been used in a variety of problem-solving settings, including automated reasoning, cognitive modelling.
Abstraction, reformulation and approximation ; 6th International symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, proceedings
This volume contains the proceedings of the 6th Symposium on Abstraction, Reformulation and Approximation (SARA 2005). the proceedings have been published in the LNAI series of Springer. Abstractions, reformulations and approximations (AR&A) have found app- cationsin avarietyofdisciplines andproblems, including constraintsatisfaction, design, diagnosis, machine learning, planning, qualitative reasoning, scheduling, resource allocation and theorem proving, but are also deeply rooted in philo- phy and cognitive science. The papers in this volume capture a cross-section of the various facets of the ?eld and of its applications. One of the primary uses of AR&A is oriented to overcome computational intractability. AR&A techniques, however, have also proved useful for knowledge acquisition, explanation and other applications.
A Short Course on Operator Semigroups
Gives a streamlined and systematic introduction to strongly continuous semigroups of bounded linear operators on Banach spaces. It treats the fundamental Hille-Yosida generation theorem as well as perturbation and approximation theorems for generators and semigroups.
A Posteriori Error Analysis Via Duality Theory : With Applications in Modeling and Numerical Approximations
This volume provides a posteriori error analysis for mathematical idealizations in modeling boundary value problems, especially those arising in mechanical applications, and for numerical approximations of numerous nonlinear variational problems. The author avoids giving the results in the most general, abstract form so that it is easier for the reader to understand more clearly the essential ideas involved. Many examples are included to show the usefulness of the derived error estimates.
A Geometry of Approximation : Rough Set Theory: Logic, Algebra and Topology of Conceptual Patterns
A Geometry of Approximation' addresses Rough Set Theory, a field of interdisciplinary research first proposed by Zdzislaw Pawlak in 1982, and focuses mainly on its logic-algebraic interpretation. The theory is embedded in a broader perspective that includes logical and mathematical methodologies pertaining to the theory, as well as related epistemological issues. Any mathematical technique that is introduced in the book is preceded by logical and epistemological explanations. Intuitive justifications are also provided, insofar as possible, so that the general perspective is not lost.
