東華大學圖書館 |

Learning and intelligent optimization = 12th International Conference, LION 12, Kalamata, Greece, June 10-15, 2018 : revised selected papers /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Learning and intelligent optimization/ edited by Roberto Battiti ... [et al.].
其他題名:	12th International Conference, LION 12, Kalamata, Greece, June 10-15, 2018 : revised selected papers /
其他題名:	LION 12
其他作者:	Battiti, Roberto.
團體作者:	LION (Conference)
出版者:	Cham :Springer International Publishing : : 2019.,
面頁冊數:	xii, 474 p. :ill. (some col.), digital ;24 cm.
內容註:	Accelerated Randomized Coordinate Descent Algorithms for Stochastic Optimization and Online Learning -- An Improved BTK Algorithm Based on Cell-like P System with Active Membranes -- A Simple Algorithmic Proof of the Symmetric Lopsided Lovasz Local Lemma -- Creating a Multi-Iterative-Priority-Rule for the Job Shop Scheduling Problem with Focus on Tardy Jobs via Genetic Programming -- A Global Optimization Algorithm for Non-Convex Mixed-Integer Problems -- Massive 2-opt and 3-opt Moves with High Performance GPU Local Search to Large-scale Traveling Salesman Problem -- Instance-Specific Selection of AOS Methods for Solving Combinatorial Optimization Problems via Neural Networks -- CAVE: Configuration Assessment, Visualization and Evaluation -- The Accuracy of One Polynomial Algorithm for the Convergecast Scheduling Problem on a Square Grid with Rectangular Obstacles -- An Effective Heuristic for a Single-Machine Scheduling Problem with Family Setups and Resource Constraints -- Learning the Quality of Dispatch Heuristics Generated by Automated Programming -- Explaining Heuristic Performance Differences for Vehicle Routing Problems with Time Windows -- Targeting Well-Balanced Solutions in Multi-Objective Bayesian Optimization under a Restricted Budget -- How Grossone Can Be Helpful to Iteratively Compute Negative Curvature Directions -- Solving Scalarized Subproblems Within Evolutionary Algorithms for Multi-Criteria Shortest Path Problems -- Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem -- Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time -- Algorithm Configuration: Learning Policies for the Quick Termination of Poor Performers -- Probability Estimation by An Adapted Genetic Algorithm in Web Insurance -- Adaptive Multi-Objective Local Search Algorithms for the Permutation Flowshop Scheduling Problem -- Portfolio Optimization Via a Surrogate Risk Measure: Conditional Desirability Value at Risk (CDVaR) -- Rover Descent: Learning to Optimize by Learning to Navigate on Prototypical Loss Surfaces -- Analysis of Algorithm Components and Parameters: Some Case Studies -- Optimality of Multiple Decision Statistical Procedure for Gaussian Graphical : Model Selection -- Hyper-Reactive Tabu Search for MaxSAT -- Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence -- A Restarting Rule Based on the Schnabel Census for Genetic Algorithms -- Intelligent Pump Scheduling Optimization in Water Distribution Networks Detecting Patterns in Benchmark Instances of the Swap-body Vehicle Routing Problem -- Evolutionary Deep Learning for Car Park Occupancy Prediction in Smart Cities -- Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman Problem in a Normed Space -- Computational Intelligence for Locating Garbage Accumulation Points in Urban Scenarios -- Fully Convolutional Neural Networks for Mapping Oil Palm Plantations in Kalimantan -- Calibration of a Water Distribution Network with Limited Field Measures: the Case Study of Castellammare di Stabia (Naples, Italy) -- Combinatorial Methods for Testing Communication Protocols in Smart Cities -- Pseudo-pyramidal Tours and Efficient Solvability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters -- Constant Factor Approximation for Intersecting Line Segments with Disks -- Scheduling Deteriorating Jobs and Module Changes with Incompatible Job Families on Parallel Machines Using a Hybrid SADE-AFSA Algorithm.
Contained By:	Springer eBooks
標題:	Machine learning - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-030-05348-2
ISBN:	9783030053482

Learning and intelligent optimization = 12th International Conference, LION 12, Kalamata, Greece, June 10-15, 2018 : revised selected papers /
Learning and intelligent optimization12th International Conference, LION 12, Kalamata, Greece, June 10-15, 2018 : revised selected papers /[electronic resource] :LION 12edited by Roberto Battiti ... [et al.]. - Cham :Springer International Publishing :2019. - xii, 474 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,113530302-9743 ;. - Lecture notes in computer science ;11353..

Accelerated Randomized Coordinate Descent Algorithms for Stochastic Optimization and Online Learning -- An Improved BTK Algorithm Based on Cell-like P System with Active Membranes -- A Simple Algorithmic Proof of the Symmetric Lopsided Lovasz Local Lemma -- Creating a Multi-Iterative-Priority-Rule for the Job Shop Scheduling Problem with Focus on Tardy Jobs via Genetic Programming -- A Global Optimization Algorithm for Non-Convex Mixed-Integer Problems -- Massive 2-opt and 3-opt Moves with High Performance GPU Local Search to Large-scale Traveling Salesman Problem -- Instance-Specific Selection of AOS Methods for Solving Combinatorial Optimization Problems via Neural Networks -- CAVE: Configuration Assessment, Visualization and Evaluation -- The Accuracy of One Polynomial Algorithm for the Convergecast Scheduling Problem on a Square Grid with Rectangular Obstacles -- An Effective Heuristic for a Single-Machine Scheduling Problem with Family Setups and Resource Constraints -- Learning the Quality of Dispatch Heuristics Generated by Automated Programming -- Explaining Heuristic Performance Differences for Vehicle Routing Problems with Time Windows -- Targeting Well-Balanced Solutions in Multi-Objective Bayesian Optimization under a Restricted Budget -- How Grossone Can Be Helpful to Iteratively Compute Negative Curvature Directions -- Solving Scalarized Subproblems Within Evolutionary Algorithms for Multi-Criteria Shortest Path Problems -- Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem -- Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time -- Algorithm Configuration: Learning Policies for the Quick Termination of Poor Performers -- Probability Estimation by An Adapted Genetic Algorithm in Web Insurance -- Adaptive Multi-Objective Local Search Algorithms for the Permutation Flowshop Scheduling Problem -- Portfolio Optimization Via a Surrogate Risk Measure: Conditional Desirability Value at Risk (CDVaR) -- Rover Descent: Learning to Optimize by Learning to Navigate on Prototypical Loss Surfaces -- Analysis of Algorithm Components and Parameters: Some Case Studies -- Optimality of Multiple Decision Statistical Procedure for Gaussian Graphical : Model Selection -- Hyper-Reactive Tabu Search for MaxSAT -- Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence -- A Restarting Rule Based on the Schnabel Census for Genetic Algorithms -- Intelligent Pump Scheduling Optimization in Water Distribution Networks Detecting Patterns in Benchmark Instances of the Swap-body Vehicle Routing Problem -- Evolutionary Deep Learning for Car Park Occupancy Prediction in Smart Cities -- Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman Problem in a Normed Space -- Computational Intelligence for Locating Garbage Accumulation Points in Urban Scenarios -- Fully Convolutional Neural Networks for Mapping Oil Palm Plantations in Kalimantan -- Calibration of a Water Distribution Network with Limited Field Measures: the Case Study of Castellammare di Stabia (Naples, Italy) -- Combinatorial Methods for Testing Communication Protocols in Smart Cities -- Pseudo-pyramidal Tours and Efficient Solvability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters -- Constant Factor Approximation for Intersecting Line Segments with Disks -- Scheduling Deteriorating Jobs and Module Changes with Incompatible Job Families on Parallel Machines Using a Hybrid SADE-AFSA Algorithm.

This book constitutes the thoroughly refereed post-conference proceedings of the 12th International Conference on Learning and Intelligent Optimization, LION 12, held in Kalamata, Greece, in June 2018. The 28 full papers and 12 short papers presented have been carefully reviewed and selected from 62 submissions. The papers explore the advanced research developments in such interconnected fields as mathematical programming, global optimization, machine learning, and artificial intelligence. Special focus is given to advanced ideas, technologies, methods, and applications in optimization and machine learning.

ISBN: 9783030053482

Standard No.: 10.1007/978-3-030-05348-2doiSubjects--Topical Terms:

576368
Machine learning
--Congresses.

LC Class. No.: Q325.5

Dewey Class. No.: 006.31

Learning and intelligent optimization = 12th International Conference, LION 12, Kalamata, Greece, June 10-15, 2018 : revised selected papers /
LDR:05407nmm a2200361 a 4500 001 2178378
003 DE-He213
005 20181231032415.0
006 m d
007 cr nn 008maaau
008 191122s2019 gw s 0 eng d
020 $a 9783030053482 $q (electronic bk.)
020 $a 9783030053475 $q (paper)
024 7 $a 10.1007/978-3-030-05348-2 $2 doi
035 $a 978-3-030-05348-2
040 $a GP $c GP
041 0 $a eng
050 4 $a Q325.5
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 006.31 $2 23
090 $a Q325.5 $b .L763 2018
111 2 $a LION (Conference) $n (12th : $d 2018 : $c Kalamata, Greece) $3 3382499
245 1 0 $a Learning and intelligent optimization $h [electronic resource] : $b 12th International Conference, LION 12, Kalamata, Greece, June 10-15, 2018 : revised selected papers / $c edited by Roberto Battiti ... [et al.].
246 3 $a LION 12
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xii, 474 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11353
490 1 $a Theoretical computer science and general issues
505 0 $a Accelerated Randomized Coordinate Descent Algorithms for Stochastic Optimization and Online Learning -- An Improved BTK Algorithm Based on Cell-like P System with Active Membranes -- A Simple Algorithmic Proof of the Symmetric Lopsided Lovasz Local Lemma -- Creating a Multi-Iterative-Priority-Rule for the Job Shop Scheduling Problem with Focus on Tardy Jobs via Genetic Programming -- A Global Optimization Algorithm for Non-Convex Mixed-Integer Problems -- Massive 2-opt and 3-opt Moves with High Performance GPU Local Search to Large-scale Traveling Salesman Problem -- Instance-Specific Selection of AOS Methods for Solving Combinatorial Optimization Problems via Neural Networks -- CAVE: Configuration Assessment, Visualization and Evaluation -- The Accuracy of One Polynomial Algorithm for the Convergecast Scheduling Problem on a Square Grid with Rectangular Obstacles -- An Effective Heuristic for a Single-Machine Scheduling Problem with Family Setups and Resource Constraints -- Learning the Quality of Dispatch Heuristics Generated by Automated Programming -- Explaining Heuristic Performance Differences for Vehicle Routing Problems with Time Windows -- Targeting Well-Balanced Solutions in Multi-Objective Bayesian Optimization under a Restricted Budget -- How Grossone Can Be Helpful to Iteratively Compute Negative Curvature Directions -- Solving Scalarized Subproblems Within Evolutionary Algorithms for Multi-Criteria Shortest Path Problems -- Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem -- Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time -- Algorithm Configuration: Learning Policies for the Quick Termination of Poor Performers -- Probability Estimation by An Adapted Genetic Algorithm in Web Insurance -- Adaptive Multi-Objective Local Search Algorithms for the Permutation Flowshop Scheduling Problem -- Portfolio Optimization Via a Surrogate Risk Measure: Conditional Desirability Value at Risk (CDVaR) -- Rover Descent: Learning to Optimize by Learning to Navigate on Prototypical Loss Surfaces -- Analysis of Algorithm Components and Parameters: Some Case Studies -- Optimality of Multiple Decision Statistical Procedure for Gaussian Graphical : Model Selection -- Hyper-Reactive Tabu Search for MaxSAT -- Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence -- A Restarting Rule Based on the Schnabel Census for Genetic Algorithms -- Intelligent Pump Scheduling Optimization in Water Distribution Networks Detecting Patterns in Benchmark Instances of the Swap-body Vehicle Routing Problem -- Evolutionary Deep Learning for Car Park Occupancy Prediction in Smart Cities -- Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman Problem in a Normed Space -- Computational Intelligence for Locating Garbage Accumulation Points in Urban Scenarios -- Fully Convolutional Neural Networks for Mapping Oil Palm Plantations in Kalimantan -- Calibration of a Water Distribution Network with Limited Field Measures: the Case Study of Castellammare di Stabia (Naples, Italy) -- Combinatorial Methods for Testing Communication Protocols in Smart Cities -- Pseudo-pyramidal Tours and Efficient Solvability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters -- Constant Factor Approximation for Intersecting Line Segments with Disks -- Scheduling Deteriorating Jobs and Module Changes with Incompatible Job Families on Parallel Machines Using a Hybrid SADE-AFSA Algorithm.
520 $a This book constitutes the thoroughly refereed post-conference proceedings of the 12th International Conference on Learning and Intelligent Optimization, LION 12, held in Kalamata, Greece, in June 2018. The 28 full papers and 12 short papers presented have been carefully reviewed and selected from 62 submissions. The papers explore the advanced research developments in such interconnected fields as mathematical programming, global optimization, machine learning, and artificial intelligence. Special focus is given to advanced ideas, technologies, methods, and applications in optimization and machine learning.
650 0 $a Machine learning $x Congresses. $3 576368
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Artificial Intelligence. $3 769149
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Numeric Computing. $3 892606
650 2 4 $a Arithmetic and Logic Structures. $3 893182
650 2 4 $a Data Structures. $3 891009
700 1 $a Battiti, Roberto. $3 1073781
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 11353. $3 3382500
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-030-05348-2
950 $a Computer Science (Springer-11645)