Hasil Pencarian  ::  Simpan CSV :: Kembali

Abstrak :
The two volume set LNCS 7491 and 7492 constitutes the refereed proceedings of the 12th International Conference on Parallel Problem Solving from Nature, PPSN 2012, held in Taormina, Sicily, Italy, in September 2012. The total of 105 revised full papers were carefully reviewed and selected from 226 submissions. The meeting began with 6 workshops which offered an ideal opportunity to explore specific topics in evolutionary computation, bio-inspired computing and metaheuristics. PPSN 2012 also included 8 tutorials. The papers are organized in topical sections on evolutionary computation, machine learning, classifier systems, image processing, experimental analysis, encoding, EDA, GP, multiobjective optimization, swarm intelligence, collective behavior, coevolution and robotics, memetic algorithms, hybridized techniques, meta and hyperheuristics, and applications.

Abstrak :
This volume, reviewing and describing major threads in the mathematical modeling of science dynamics for a wider academic and professional audience. The model classes presented cover stochastic and statistical models, system-dynamics approaches, agent-based simulations, population-dynamics models, and complex-network models. The book comprises an introduction and a foundational chapter that defines and operationalizes terminology used in the study of science, as well as a review chapter that discusses the history of mathematical approaches to modeling science from an algorithmic-historiography perspective. It concludes with a survey of remaining challenges for future science models and their relevance for science and science policy.

Abstrak :
This is book devoted to the systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is a typical example of a hard to define notion, the authors devised an unifying classification of general classes of structures. This approach is very robust and it has many remarkable properties. For example the classification is expressible in many different ways involving most extremal combinatorial invariants. This study of sparse structures found applications in such diverse areas as algorithmic graph theory, complexity of algorithms, property testing, descriptive complexity and mathematical logic (homomorphism preservation,fixed parameter tractability and constraint satisfaction problems). It should be stressed that despite of its generality this approach leads to linear (and nearly linear) algorithms.

Abstrak :
This work presents lines of investigation and scientific achievements of the Ukrainian school of optimization theory and adjacent disciplines. These include the development of approaches to mathematical theories, methodologies, methods, and application systems for the solution of applied problems in economy, finances, energy saving, agriculture, biology, genetics, environmental protection, hardware and software engineering, information protection, decision making, pattern recognition, self-adapting control of complicated objects, personnel training, etc. The methods developed include sequential analysis of variants, nondifferential optimization, stochastic optimization, discrete optimization, mathematical modeling, econometric modeling, solution of extremum problems on graphs, construction of discrete images and combinatorial recognition, etc. Some of these methods became well known in the world's mathematical community and are now known as classic methods.

Abstrak :
Many fundamental combinatorial problems, arising in such diverse fields as artificial intelligence, logic, graph theory, and linear algebra, can be formulated as Boolean constraint satisfaction problems (CSP). This book is devoted to the study of the complexity of such problems. The authors' goal is to develop a framework for classifying the complexity of Boolean CSP in a uniform way. In doing so, they bring out common themes underlying many concepts and results in both algorithms and complexity theory. The results and techniques presented here show that Boolean CSP provide an excellent framework for discovering and formally validating "global" inferences about the nature of computation.

Abstrak :
Focuses on finding the minimum number of arithmetic operations needed to perform the computation and on finding a better algorithm when improvement is possible. The author concentrates on that class of problems concerned with computing a system of bilinear forms. Results that lead to applications in the area of signal processing are emphasized, since (1) even a modest reduction in the execution time of signal processing problems could have practical significance; (2) results in this area are relatively new and are scattered in journal articles; and (3) this emphasis indicates the flavor of complexity of computation.

Abstrak :
An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations. The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes.

Abstrak :
In this book the author presents general techniques for analysing the structure of such functions and the computational complexity of the minimisation problem, and he gives a comprehensive list of tractable cases. Moreover, he demonstrates that the so-called algebraic approach to VCSPs can be used not only for the search for tractable VCSPs, but also for other questions such as finding the boundaries to the applicability of certain algorithmic techniques.

Abstrak :
This book constitutes the refereed proceedings of the 9th International Conference on Theory and Applications of Models of Computation, TAMC 2012, held in Beijing, China, in May 2012. The conference was combined with the Turing Lectures 2012, dedicated to celebrating Alan Turing’s unique impact on mathematics, computing, computer science, informatics, morphogenesis, philosophy, and the wider scientific world. Eight Turing Lectures were given at the TAMC 2012. The 40 revised full papers presented together with invited talks were carefully reviewed and selected from 86 submissions. The papers address 4 special sessions at TAMC 2012 which were algorithms and information in networks, complexity and cryptography, models of computing and networking, programming and verification.