Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	März 2010
Genre:	Schulbücher
	Algorithm Analysis and Problem Complexity / Algorithms / Automated Pattern Recognition / C / Computation by Abstract Devices / computer science / Computer science—Mathematics / Computer Vision / Computers / Discrete Mathematics / Discrete Mathematics in Computer Science / Diskrete Mathematik / Image processing / Image Processing and Computer Vision / Mathematik für Informatiker / Maths for computer scientists / Optical data processing / pattern recognition / Theory of Computation mehr...
ISBN:	9783642121388
EAN-Code:	9783642121388
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#6022 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H / B / D
Gewicht:	480 gr
Seiten:	290
Illustration:	XII, 290 p. 67 illus., schwarz-weiss Illustrationen
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling.- Heuristic and Exact Methods for the Discrete (r |p)-Centroid Problem.- On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme.- A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study.- Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems.- A Genetic Algorithm to Minimize Chromatic Entropy.- Evolutionary Approaches to the Three-dimensional Multi-pipe Routing Problem: A Comparative Study Using Direct Encodings.- A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks.- Ant Colony Optimization for Tree Decompositions.- Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Times.- Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures.- Characterizing Fault-Tolerance of Genetic Algorithms in Desktop Grid Systems.- The Office-Space-Allocation Problem in Strongly Hierarchized Organizations.- A Study of Memetic Search with Multi-parent Combination for UBQP.- Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealing.- A Memetic Algorithm for Workforce Distribution in Dynamic Multi-Skill Call Centres.- Geometric Generalization of the Nelder-Mead Algorithm.- Guided Ejection Search for the Pickup and Delivery Problem with Time Windows.- An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Principles.- Multilevel Variable Neighborhood Search for Periodic Routing Problems.- Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive.- A New Primal-Dual Genetic Algorithm: Case Study for the Winner Determination Problem.- Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem.- Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problem.