Learning and Intelligent Optimization
Springer Berlin (Verlag)
978-3-642-44972-7 (ISBN)
Interleaving Innovization with Evolutionary Multi-Objective Optimization in Production System Simulation for Faster Convergence.- Intelligent optimization for the minimum labelling spanning tree problem.- A Constraint Satisfaction Approach to Tractable Theory Induction.- Features for Exploiting Black-Box Optimization Problem Structure.- MOCA-I: Discovering Rules and Guiding Decision Maker in the Context of Partial Classification in Large and Imbalanced Datasets.- Sharing Information in Parallel Search with Search Space Partitioning.- Fast Computation of the Multi-points Expected Improvement with Applications in Batch Selection.- R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection.- A Heuristic Algorithm for the Set Multicover Problem with Generalized Upper Bound Constraints.- A genetic algorithm approach for the multidimensional two-way number partitioning problem.- Adaptive Dynamic Load Balancing in Heterogeneous Multiple GPUs-CPUs Distributed Setting: Case Study of B&B Tree Search.- Multi-objective optimization for relevant sub-graph extraction.- PROGRESS: Progressive Reinforcement-Learning-Based Surrogate Selection.- Neutrality in the Graph Coloring Problem.- Kernel multi label vector optimization (kMLVO) - A unified multi-label classification formalism.- Robust Benchmark Set Selection for Boolean Constraint Solvers.- Boosting Sequential Solver Portfolios: Knowledge Sharing and Accuracy Prediction.- A Fast and Adaptive Local Search Algorithm for Multi-Objective Optimization.- An Analysis of Hall-of-Fame Strategies in Competitive Coevolutionary Algorithms for Self-Learning in RTS Games.- Resources Optimization in (Video) Games: a Novel Approach to Teach Applied Mathematics.- CMF: a combinatorial tool to find composite motifs.- Hill-climbing Behaviour on Quantized NK-landscapes.- Neighbourhood Specification for Game Strategy Evolution in a Spatial Iterated Prisoners Dilemma Game.- A Study on the Specification of a Scalarizing Function in MOEA/D for Many-Objective Knapsack Problems.- Portfolio with Block Branching for Parallel SAT Solvers.- Parameter Setting with Dynamic Island Models.- A simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints.- Solution of the maximum k-balanced subgraph problem.- Racing with a Fixed Budget and a Self-Adaptive Significance Level.- An efficient best response heuristic for a non-preemptive strictly periodic scheduling problem.- Finding an evolutionary solution to the game of Mastermind with good scaling behaviour.- A Fast Local Search Approach For Multiobjective problems.- Generating Customized Landscapes in Permutation-based Combinatorial Optimization Problems.- Multiobjective Evolution of Mixed Nash Equilibria.- Hybridizing Constraint Programming and Monte-Carlo Tree Search: Application to the Job Shop problem.- From Grammars to Parameters: Automatic Iterated Greedy Design for the Permutation Flow-shop Problem with Weighted Tardiness.- Architecture for Monitoring Learning Processes using Video Games.- Quality Measures of Parameter Tuning for Aggregated Multi-Objective Temporal Planning.- Evolutionary FSM-Based Agents for Playing Super Mario Game.- Identifying Key Algorithm Parameters and Instance Features using Forward Selection.- Using Racing to Automatically Configure Algorithms for Scaling Performance.- Algorithm Selection for the Graph Coloring Problem.- Batched Mode Hyper-heuristics.- Tuning algorithms for tackling large instances: An experimental protocol.- Automated Parameter Tuning Framework for Heterogeneous and Large Instances: Case Study in Quadratic Assignment Problem.- Practically Desirable Solutions Search on Multi-Objective Optimization.- Oversized Populations and Cooperative Selection: Dealing with Massive Resources in Parallel Infrastructures.- Effects of Population Size on Selection and Scalability in Evolutionary Many-objective Optimization.- A novel feature selection method for classification using a fuzzy criterion.
| Erscheint lt. Verlag | 9.12.2013 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XV, 470 p. 120 illus. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 732 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • constraints • Game Theory • graph problems • Multi-Objective Optimization • SAT solvers |
| ISBN-10 | 3-642-44972-7 / 3642449727 |
| ISBN-13 | 978-3-642-44972-7 / 9783642449727 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
