Søgning på underkategorier- og emner:
Current research results in stochastic and deterministic global optimization including single and multiple objectives are explored and presented in this book by leading specialists from various fields.
This book aims to provide a general overview of heuristic search, to present the basic steps of the most popular heuristics, and to stress their hidden difficulties as well as their opportunities.
This book provides a comprehensive account of the glowworm swarm optimization (GSO) algorithm, including details of the underlying ideas, theoretical foundations, algorithm development, various applications, and MATLAB programs for the basic GSO algorithm.
Among all computer-generated mathematical images, Julia sets of rational maps occupy one of the most prominent positions. The book summarizes the present knowledge (most of it from the authors' own work) about the computational properties of Julia sets in a self-contained way.
Die Autoren gehen auf die gesetzlichen Bestimmungen ein, arbeiten die Klassifizierungskonzepte heraus und erläutern die Sicherheitskonzepte und ihre Anforderungen an Betriebsführung und Unternehmen sowie das Disaster Recovery als Bestandteil einer Security-Strategie.
Our thanks go to Hai Jin and George Papapodoulos, the conference General Co-chairs, and Andrzej Goscinski, W- lei Zhou and Yi Pan, the conference Steering Committee Co-chairs for help in many aspects of organizing this conference.
Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times... Læs mere
The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends such as algorithm engineering, memory hierarchies, algorithm libraries and certifying algorithms.
The purpose of this book is to provide tools for a better understanding of the fundamental tradeo?s and interdependencies in wireless networks, with the goal of designing resource allocation strategies that exploit these int- dependencies to achieve signi?cant performance gains.
Algorithmen bilden das Herzstück jeder nichttrivialen Anwendung von Computern, und die Algorithmik ist ein modernes und aktives Gebiet der Informatik.
Finite model theory is an area of mathematical logic that grew out of computer science applications. The birth of finite model theory is often identified with Trakhtenbrot's result from 1950 stating that validity over finite models is not recursively enumerable;