Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Learning and Intelligent Optimization [[electronic resource] ] : 12th International Conference, LION 12, Kalamata, Greece, June 10–15, 2018, Revised Selected Papers / / edited by Roberto Battiti, Mauro Brunato, Ilias Kotsireas, Panos M. Pardalos
| Learning and Intelligent Optimization [[electronic resource] ] : 12th International Conference, LION 12, Kalamata, Greece, June 10–15, 2018, Revised Selected Papers / / edited by Roberto Battiti, Mauro Brunato, Ilias Kotsireas, Panos M. Pardalos |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XII, 474 p. 145 illus., 93 illus. in color.) |
| Disciplina | 006.31 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence Computer science—Mathematics Discrete mathematics Numerical analysis Computer arithmetic and logic units Artificial intelligence—Data processing Artificial Intelligence Discrete Mathematics in Computer Science Numerical Analysis Arithmetic and Logic Structures Data Science |
| ISBN | 3-030-05348-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 Lovász 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. |
| Record Nr. | UNISA-996466450903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Learning and Intelligent Optimization : 12th International Conference, LION 12, Kalamata, Greece, June 10–15, 2018, Revised Selected Papers / / edited by Roberto Battiti, Mauro Brunato, Ilias Kotsireas, Panos M. Pardalos
| Learning and Intelligent Optimization : 12th International Conference, LION 12, Kalamata, Greece, June 10–15, 2018, Revised Selected Papers / / edited by Roberto Battiti, Mauro Brunato, Ilias Kotsireas, Panos M. Pardalos |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XII, 474 p. 145 illus., 93 illus. in color.) |
| Disciplina | 006.31 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence Computer science—Mathematics Discrete mathematics Numerical analysis Computer arithmetic and logic units Artificial intelligence—Data processing Artificial Intelligence Discrete Mathematics in Computer Science Numerical Analysis Arithmetic and Logic Structures Data Science |
| ISBN | 3-030-05348-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 Lovász 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. |
| Record Nr. | UNINA-9910337562703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Learning and Intelligent Optimization [[electronic resource] ] : 11th International Conference, LION 11, Nizhny Novgorod, Russia, June 19-21, 2017, Revised Selected Papers / / edited by Roberto Battiti, Dmitri E. Kvasov, Yaroslav D. Sergeyev
| Learning and Intelligent Optimization [[electronic resource] ] : 11th International Conference, LION 11, Nizhny Novgorod, Russia, June 19-21, 2017, Revised Selected Papers / / edited by Roberto Battiti, Dmitri E. Kvasov, Yaroslav D. Sergeyev |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XIII, 390 p. 92 illus.) |
| Disciplina | 006.31 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Artificial intelligence Numerical analysis Computer simulation Computer Science Logic and Foundations of Programming Artificial Intelligence Numerical Analysis Theory of Computation Computer Modelling |
| ISBN | 3-319-69404-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Long Papers -- An Importance Sampling Approach to the Estimation of Algorithm Performance in Automated Algorithm Design -- 1 Introduction -- 2 The Algorithm Design Problem (ADP) -- 3 Performance Estimation in PbO -- 3.1 Prior Art -- 3.2 An Importance Sampling Approach -- 4 Envisioned Benefits -- 5 Theoretical Feasibility -- 6 The Proof of Concept -- 6.1 Practical Challenges -- 6.2 High-Level Search Strategy -- 7 Experiments -- 7.1 Experimental Setup -- 7.2 Results and Discussion -- 8 Conclusion -- References -- Test Problems for Parallel Algorithms of Constrained Global Optimization -- 1 Introduction -- 2 Problem Statement -- 3 Generating a Series of Problems -- 4 Parallel Global Optimization Index Algorithm -- 5 Results of Numerical Experiments -- 6 Conclusion -- References -- Automatic Configuration of Kernel-Based Clustering: An Optimization Approach -- Abstract -- 1 Introduction -- 2 Material and Methods -- 2.1 Notation -- 2.2 The Case Study and the Data Generation Process -- 2.3 Kernel K-means -- 3 Hyperparameter Optimization of the Unsupervised Learning Phase of the Machine Learning Pipeline -- 3.1 Hyperparameters in the Pipeline: The Design Variables -- 3.2 Clustering Performance: The Objective Function -- 3.3 Sequential Model Based Optimization -- 3.3.1 Building the Surrogate of the Objective Function: Gaussian Processes and Random Forest -- 3.3.2 Acquisition Function: Confidence Bound -- 3.3.3 Termination Criterion -- 3.3.4 Software Environment -- 4 Results and Discussion -- 5 Conclusions -- References -- Solution of the Convergecast Scheduling Problem on a Square Unit Grid When the Transmission Range is 2 -- 1 Introduction -- 2 General Problem Formulation -- 3 CSP in the Unit Square Grid When the Transmission Distance is 2 -- 3.1 The Exact Lower Bound for the Schedule Length.
3.2 Algorithm A -- 4 Conclusion -- References -- A GRASP for the Minimum Cost SAT Problem -- 1 Introduction -- 2 Mathematical Formulation of the Problem -- 3 A GRASP for MinCostSAT -- 4 Probabilistic Stopping Rule -- 4.1 Fitting Data Procedure -- 4.2 Improve Probability Procedure -- 5 Results -- 6 Conclusions -- References -- A New Local Search for the p-Center Problem Based on the Critical Vertex Concept -- 1 Introduction -- 2 GRASP Construction Phase -- 3 Plateau Surfer: A New Local Search Based on the Critical Vertex Concept -- 4 Experimental Results -- 5 Concluding Remarks -- References -- An Iterated Local Search Framework with Adaptive Operator Selection for Nurse Rostering -- 1 Introduction -- 2 The Nurse Rostering Problem -- 3 The Proposed Approach -- 3.1 Credit Assignment Module -- 3.2 Action Selection Methodology -- 4 Experimental Results -- 4.1 Experimental Setup -- 4.2 Experimental Results and Analysis -- 5 Conclusions -- References -- Learning a Reactive Restart Strategy to Improve Stochastic Search -- 1 Introduction -- 2 Restart Strategies -- 3 Learning Dynamic Parameter Updates -- 4 A Hyper-Parameterized Restart Strategy -- 4.1 Features -- 4.2 Turning Features into Scores -- 4.3 The Reactive Restart Framework -- 5 Experimental Analysis -- 5.1 Problems and Benchmarks -- 5.2 Data Collection -- 5.3 Training of Hyper -- 5.4 Results -- 6 Conclusion -- References -- Efficient Adaptive Implementation of the Serial Schedule Generation Scheme Using Preprocessing and Bloom Filters -- 1 Introduction -- 2 SSGS Implementation Details -- 2.1 Initialisation of A -- 2.2 Efficient Search of the Earliest Feasible Slot for a Job -- 2.3 Preprocessing and Automated Parameter Control -- 3 SSGS Implementation Using Bloom Filters -- 3.1 Optimisation of Bloom Filter Structure -- 3.2 Additional Speed-ups -- 4 Hybrid Control Mechanism -- 5 Empirical Evaluation. 6 Conclusions and Future Work -- References -- Interior Point and Newton Methods in Solving High Dimensional Flow Distribution Problems for Pipe Networks -- 1 Introduction -- 2 Problem Statement -- 3 Newton Method -- 4 Interior Point Method -- 5 Matrices Multiplication in Interior Point Method -- 6 Acceleration by Constant Multiplication -- 7 Combined Method for Constrained Problem -- 8 Numerical Results -- 9 Conclusion -- References -- Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem -- 1 Introduction -- 2 Related Work -- 3 Problem Formalization -- 3.1 Solution Representation -- 3.2 Objective -- 3.3 Calculation of Fulfilled Customer Demand -- 3.4 Calculation of Rebalancing Costs -- 4 Multilevel Refinement Approach -- 4.1 Coarsening -- 4.2 Initialization -- 4.3 Extension -- 5 Computational Results -- 6 Conclusion and Future Work -- References -- Decomposition Descent Method for Limit Optimization Problems -- 1 Introduction -- 2 Auxiliary Problem Properties -- 3 Limit Decomposition Method and its Convergence -- 4 Modifications and Applications -- 5 Computational Experiments -- 6 Conclusions -- References -- RAMBO: Resource-Aware Model-Based Optimization with Scheduling for Heterogeneous Runtimes and a Comparison with Asynchronous Model-Based Optimization -- 1 Introduction -- 2 Model-Based Global Optimization -- 2.1 Parallel MBO -- 3 Resource-Aware Scheduling with Synchronous Model Update -- 3.1 Infill Criterion - Priority -- 3.2 Resource Estimation -- 3.3 Resource-Aware Knapsack Scheduling -- 3.4 Refinement of Job Priorities via Clustering -- 4 Numerical Experiments -- 4.1 Quality of Resource Estimation -- 4.2 High Runtime Estimation Quality: rosenbrock -- 4.3 Low Runtime Estimation Quality: rastrigin -- 5 Conclusion -- References -- A New Constructive Heuristic for the No-Wait Flowshop Scheduling Problem. 1 Introduction -- 2 The No-Wait Flowshop Scheduling Problem -- 2.1 Description of the Problem -- 2.2 State-of-the-Art -- 3 IBI: Iterated Best Insertion Heuristic -- 3.1 Analysis of Optimal Solutions Structure -- 3.2 Design of IBI -- 3.3 Experimental Analysis of Parameters -- 4 Experiments -- 4.1 Efficiency of IBI -- 4.2 IBI as Initialization of a Local Search -- 5 Conclusion and Perspectives -- References -- Sharp Penalty Mappings for Variational Inequality Problems -- 1 Introduction -- 2 Notations and Preliminaries -- 3 Sharp Penalty Mappings -- 4 Iteration Algorithm -- 5 Conclusions -- References -- A Nonconvex Optimization Approach to Quadratic Bilevel Problems -- 1 Introduction -- 2 Statement of the Problem and Its Reduction -- 3 The Local Search -- 4 Global Optimality Conditions and the Global Search Procedure -- 5 Computational Simulation -- 6 Conclusion -- References -- An Experimental Study of Adaptive Capping in irace -- 1 Introduction -- 2 Elitist Iterated Racing in irace -- 3 ParamILS and Adaptive Capping -- 4 Adaptive Capping in irace -- 5 Experiments -- 5.1 Experimental Setup -- 5.2 Experimental Results -- 5.3 Additional Analysis of iracecap -- 6 Comparison to Other Configurators -- 7 Conclusions -- References -- Duality Gap Analysis of Weak Relaxed Greedy Algorithms -- 1 Introduction -- 2 Weak Relaxed Greedy Algorithms -- 3 Dual Convergence Results -- 3.1 Duality Gap -- 3.2 Dual Convergence Result for WRGA(co) -- 3.3 Dual Convergence Result for WRGA() -- 4 Conclusion -- References -- Controlling Some Statistical Properties of Business Rules Programs -- 1 Introduction -- 1.1 Preliminaries -- 1.2 Related Works -- 2 Learning Goals with Histograms -- 2.1 A MIP for Learning Quantized Distributions -- 2.2 A MILP for the Max Percentage Problem -- 2.3 A MILP for the Almost Uniform Distribution Problem -- 3 Implementation and Experiments. 3.1 The Max Percentage Problem -- 3.2 The Almost Uniform Distribution Problem -- 4 Conclusion, Discussion and Future Work -- References -- GENOPT Paper -- Hybridization and Discretization Techniques to Speed Up Genetic Algorithm and Solve GENOPT Problems -- Abstract -- 1 Introduction -- 2 Preliminary Concepts -- 3 The GABRLS Algorithm -- 3.1 The Modified GA -- 3.2 Bounding Restart (BR) Technique -- 3.3 Hybridizing GABR with Local Searches -- 4 Tuning and Results of GABRLS on GENOPT Challenge -- 4.1 High Level Setting -- 4.2 Results and Prizes -- 5 Conclusion -- References -- Short Papers -- Identification of Discontinuous Thermal Conductivity Coefficient Using Fast Automatic Differentiation -- Abstract -- 1 Introduction -- 2 Formulation of the Problem -- 3 Numerical Solution of the Problem -- Acknowledgments -- References -- Comparing Two Approaches for Solving Constrained Global Optimization Problems -- 1 Introduction -- 2 Index Method -- 3 Results of Experiments -- 4 Conclusion -- References -- Towards a Universal Modeller of Chaotic Systems -- 1 Introduction -- 2 Previous Work -- 3 Learning Algorithm -- 3.1 Idle Mode -- 4 Experimental Setup -- 4.1 Repetition -- 4.2 Fractal Dimension -- 4.3 Lyapunov Exponent -- 5 Results -- 6 Conclusion -- References -- An Approach for Generating Test Problems of Constrained Global Optimization -- 1 Introduction -- 2 Test Problem Classes -- 3 Some Numerical Results -- 4 Conclusion -- References -- Global Optimization Using Numerical Approximations of Derivatives -- 1 Introduction -- 2 One-Dimensional Global Optimization Algorithm Using Numerical Estimations of Derivatives -- 2.1 Core One-Dimensional Global Search Algorithm Using Derivatives -- 2.2 One-Dimensional Global Search Algorithm Using Numerical Derivatives -- 3 Results of Computational Experiments -- 4 Conclusion -- References. Global Optimization Challenges in Structured Low Rank Approximation. |
| Record Nr. | UNISA-996465339903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Learning and Intelligent Optimization : 11th International Conference, LION 11, Nizhny Novgorod, Russia, June 19-21, 2017, Revised Selected Papers / / edited by Roberto Battiti, Dmitri E. Kvasov, Yaroslav D. Sergeyev
| Learning and Intelligent Optimization : 11th International Conference, LION 11, Nizhny Novgorod, Russia, June 19-21, 2017, Revised Selected Papers / / edited by Roberto Battiti, Dmitri E. Kvasov, Yaroslav D. Sergeyev |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XIII, 390 p. 92 illus.) |
| Disciplina | 006.31 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Artificial intelligence Numerical analysis Computer simulation Computer Science Logic and Foundations of Programming Artificial Intelligence Numerical Analysis Theory of Computation Computer Modelling |
| ISBN | 3-319-69404-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Long Papers -- An Importance Sampling Approach to the Estimation of Algorithm Performance in Automated Algorithm Design -- 1 Introduction -- 2 The Algorithm Design Problem (ADP) -- 3 Performance Estimation in PbO -- 3.1 Prior Art -- 3.2 An Importance Sampling Approach -- 4 Envisioned Benefits -- 5 Theoretical Feasibility -- 6 The Proof of Concept -- 6.1 Practical Challenges -- 6.2 High-Level Search Strategy -- 7 Experiments -- 7.1 Experimental Setup -- 7.2 Results and Discussion -- 8 Conclusion -- References -- Test Problems for Parallel Algorithms of Constrained Global Optimization -- 1 Introduction -- 2 Problem Statement -- 3 Generating a Series of Problems -- 4 Parallel Global Optimization Index Algorithm -- 5 Results of Numerical Experiments -- 6 Conclusion -- References -- Automatic Configuration of Kernel-Based Clustering: An Optimization Approach -- Abstract -- 1 Introduction -- 2 Material and Methods -- 2.1 Notation -- 2.2 The Case Study and the Data Generation Process -- 2.3 Kernel K-means -- 3 Hyperparameter Optimization of the Unsupervised Learning Phase of the Machine Learning Pipeline -- 3.1 Hyperparameters in the Pipeline: The Design Variables -- 3.2 Clustering Performance: The Objective Function -- 3.3 Sequential Model Based Optimization -- 3.3.1 Building the Surrogate of the Objective Function: Gaussian Processes and Random Forest -- 3.3.2 Acquisition Function: Confidence Bound -- 3.3.3 Termination Criterion -- 3.3.4 Software Environment -- 4 Results and Discussion -- 5 Conclusions -- References -- Solution of the Convergecast Scheduling Problem on a Square Unit Grid When the Transmission Range is 2 -- 1 Introduction -- 2 General Problem Formulation -- 3 CSP in the Unit Square Grid When the Transmission Distance is 2 -- 3.1 The Exact Lower Bound for the Schedule Length.
3.2 Algorithm A -- 4 Conclusion -- References -- A GRASP for the Minimum Cost SAT Problem -- 1 Introduction -- 2 Mathematical Formulation of the Problem -- 3 A GRASP for MinCostSAT -- 4 Probabilistic Stopping Rule -- 4.1 Fitting Data Procedure -- 4.2 Improve Probability Procedure -- 5 Results -- 6 Conclusions -- References -- A New Local Search for the p-Center Problem Based on the Critical Vertex Concept -- 1 Introduction -- 2 GRASP Construction Phase -- 3 Plateau Surfer: A New Local Search Based on the Critical Vertex Concept -- 4 Experimental Results -- 5 Concluding Remarks -- References -- An Iterated Local Search Framework with Adaptive Operator Selection for Nurse Rostering -- 1 Introduction -- 2 The Nurse Rostering Problem -- 3 The Proposed Approach -- 3.1 Credit Assignment Module -- 3.2 Action Selection Methodology -- 4 Experimental Results -- 4.1 Experimental Setup -- 4.2 Experimental Results and Analysis -- 5 Conclusions -- References -- Learning a Reactive Restart Strategy to Improve Stochastic Search -- 1 Introduction -- 2 Restart Strategies -- 3 Learning Dynamic Parameter Updates -- 4 A Hyper-Parameterized Restart Strategy -- 4.1 Features -- 4.2 Turning Features into Scores -- 4.3 The Reactive Restart Framework -- 5 Experimental Analysis -- 5.1 Problems and Benchmarks -- 5.2 Data Collection -- 5.3 Training of Hyper -- 5.4 Results -- 6 Conclusion -- References -- Efficient Adaptive Implementation of the Serial Schedule Generation Scheme Using Preprocessing and Bloom Filters -- 1 Introduction -- 2 SSGS Implementation Details -- 2.1 Initialisation of A -- 2.2 Efficient Search of the Earliest Feasible Slot for a Job -- 2.3 Preprocessing and Automated Parameter Control -- 3 SSGS Implementation Using Bloom Filters -- 3.1 Optimisation of Bloom Filter Structure -- 3.2 Additional Speed-ups -- 4 Hybrid Control Mechanism -- 5 Empirical Evaluation. 6 Conclusions and Future Work -- References -- Interior Point and Newton Methods in Solving High Dimensional Flow Distribution Problems for Pipe Networks -- 1 Introduction -- 2 Problem Statement -- 3 Newton Method -- 4 Interior Point Method -- 5 Matrices Multiplication in Interior Point Method -- 6 Acceleration by Constant Multiplication -- 7 Combined Method for Constrained Problem -- 8 Numerical Results -- 9 Conclusion -- References -- Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem -- 1 Introduction -- 2 Related Work -- 3 Problem Formalization -- 3.1 Solution Representation -- 3.2 Objective -- 3.3 Calculation of Fulfilled Customer Demand -- 3.4 Calculation of Rebalancing Costs -- 4 Multilevel Refinement Approach -- 4.1 Coarsening -- 4.2 Initialization -- 4.3 Extension -- 5 Computational Results -- 6 Conclusion and Future Work -- References -- Decomposition Descent Method for Limit Optimization Problems -- 1 Introduction -- 2 Auxiliary Problem Properties -- 3 Limit Decomposition Method and its Convergence -- 4 Modifications and Applications -- 5 Computational Experiments -- 6 Conclusions -- References -- RAMBO: Resource-Aware Model-Based Optimization with Scheduling for Heterogeneous Runtimes and a Comparison with Asynchronous Model-Based Optimization -- 1 Introduction -- 2 Model-Based Global Optimization -- 2.1 Parallel MBO -- 3 Resource-Aware Scheduling with Synchronous Model Update -- 3.1 Infill Criterion - Priority -- 3.2 Resource Estimation -- 3.3 Resource-Aware Knapsack Scheduling -- 3.4 Refinement of Job Priorities via Clustering -- 4 Numerical Experiments -- 4.1 Quality of Resource Estimation -- 4.2 High Runtime Estimation Quality: rosenbrock -- 4.3 Low Runtime Estimation Quality: rastrigin -- 5 Conclusion -- References -- A New Constructive Heuristic for the No-Wait Flowshop Scheduling Problem. 1 Introduction -- 2 The No-Wait Flowshop Scheduling Problem -- 2.1 Description of the Problem -- 2.2 State-of-the-Art -- 3 IBI: Iterated Best Insertion Heuristic -- 3.1 Analysis of Optimal Solutions Structure -- 3.2 Design of IBI -- 3.3 Experimental Analysis of Parameters -- 4 Experiments -- 4.1 Efficiency of IBI -- 4.2 IBI as Initialization of a Local Search -- 5 Conclusion and Perspectives -- References -- Sharp Penalty Mappings for Variational Inequality Problems -- 1 Introduction -- 2 Notations and Preliminaries -- 3 Sharp Penalty Mappings -- 4 Iteration Algorithm -- 5 Conclusions -- References -- A Nonconvex Optimization Approach to Quadratic Bilevel Problems -- 1 Introduction -- 2 Statement of the Problem and Its Reduction -- 3 The Local Search -- 4 Global Optimality Conditions and the Global Search Procedure -- 5 Computational Simulation -- 6 Conclusion -- References -- An Experimental Study of Adaptive Capping in irace -- 1 Introduction -- 2 Elitist Iterated Racing in irace -- 3 ParamILS and Adaptive Capping -- 4 Adaptive Capping in irace -- 5 Experiments -- 5.1 Experimental Setup -- 5.2 Experimental Results -- 5.3 Additional Analysis of iracecap -- 6 Comparison to Other Configurators -- 7 Conclusions -- References -- Duality Gap Analysis of Weak Relaxed Greedy Algorithms -- 1 Introduction -- 2 Weak Relaxed Greedy Algorithms -- 3 Dual Convergence Results -- 3.1 Duality Gap -- 3.2 Dual Convergence Result for WRGA(co) -- 3.3 Dual Convergence Result for WRGA() -- 4 Conclusion -- References -- Controlling Some Statistical Properties of Business Rules Programs -- 1 Introduction -- 1.1 Preliminaries -- 1.2 Related Works -- 2 Learning Goals with Histograms -- 2.1 A MIP for Learning Quantized Distributions -- 2.2 A MILP for the Max Percentage Problem -- 2.3 A MILP for the Almost Uniform Distribution Problem -- 3 Implementation and Experiments. 3.1 The Max Percentage Problem -- 3.2 The Almost Uniform Distribution Problem -- 4 Conclusion, Discussion and Future Work -- References -- GENOPT Paper -- Hybridization and Discretization Techniques to Speed Up Genetic Algorithm and Solve GENOPT Problems -- Abstract -- 1 Introduction -- 2 Preliminary Concepts -- 3 The GABRLS Algorithm -- 3.1 The Modified GA -- 3.2 Bounding Restart (BR) Technique -- 3.3 Hybridizing GABR with Local Searches -- 4 Tuning and Results of GABRLS on GENOPT Challenge -- 4.1 High Level Setting -- 4.2 Results and Prizes -- 5 Conclusion -- References -- Short Papers -- Identification of Discontinuous Thermal Conductivity Coefficient Using Fast Automatic Differentiation -- Abstract -- 1 Introduction -- 2 Formulation of the Problem -- 3 Numerical Solution of the Problem -- Acknowledgments -- References -- Comparing Two Approaches for Solving Constrained Global Optimization Problems -- 1 Introduction -- 2 Index Method -- 3 Results of Experiments -- 4 Conclusion -- References -- Towards a Universal Modeller of Chaotic Systems -- 1 Introduction -- 2 Previous Work -- 3 Learning Algorithm -- 3.1 Idle Mode -- 4 Experimental Setup -- 4.1 Repetition -- 4.2 Fractal Dimension -- 4.3 Lyapunov Exponent -- 5 Results -- 6 Conclusion -- References -- An Approach for Generating Test Problems of Constrained Global Optimization -- 1 Introduction -- 2 Test Problem Classes -- 3 Some Numerical Results -- 4 Conclusion -- References -- Global Optimization Using Numerical Approximations of Derivatives -- 1 Introduction -- 2 One-Dimensional Global Optimization Algorithm Using Numerical Estimations of Derivatives -- 2.1 Core One-Dimensional Global Search Algorithm Using Derivatives -- 2.2 One-Dimensional Global Search Algorithm Using Numerical Derivatives -- 3 Results of Computational Experiments -- 4 Conclusion -- References. Global Optimization Challenges in Structured Low Rank Approximation. |
| Record Nr. | UNINA-9910482962603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Learning and Intelligent Optimization [[electronic resource] ] : 4th International Conference, LION 4, Venice, Italy, January 2010. Selected Papers / / edited by Christian Blum, Roberto Battiti
| Learning and Intelligent Optimization [[electronic resource] ] : 4th International Conference, LION 4, Venice, Italy, January 2010. Selected Papers / / edited by Christian Blum, Roberto Battiti |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIV, 344 p. 97 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Artificial intelligence Computer networks Pattern recognition systems Computer science—Mathematics Discrete mathematics Theory of Computation Artificial Intelligence Computer Communication Networks Automated Pattern Recognition Discrete Mathematics in Computer Science |
| ISBN |
1-280-38739-4
9786613565310 3-642-13800-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Main Track (Regular Papers) -- A Column Generation Heuristic for the General Vehicle Routing Problem -- A Combination of Evolutionary Algorithm, Mathematical Programming, and a New Local Search Procedure for the Just-In-Time Job-Shop Scheduling Problem -- A Math-Heuristic Algorithm for the DNA Sequencing Problem -- A Randomized Iterated Greedy Algorithm for the Founder Sequence Reconstruction Problem -- Adaptive “Anytime” Two-Phase Local Search -- Adaptive Filter SQP -- Algorithm Selection as a Bandit Problem with Unbounded Losses -- Bandit-Based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime Analysis -- Consistency Modifications for Automatically Tuned Monte-Carlo Tree Search -- Distance Functions, Clustering Algorithms and Microarray Data Analysis -- Gaussian Process Assisted Particle Swarm Optimization -- Learning of Highly-Filtered Data Manifold Using Spectral Methods -- Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables -- Main Track (Short Papers) -- A Linear Approximation of the Value Function of an Approximate Dynamic Programming Approach for the Ship Scheduling Problem -- A Multilevel Scheme with Adaptive Memory Strategy for Multiway Graph Partitioning -- A Network Approach for Restructuring the Korean Freight Railway Considering Customer Behavior -- A Parallel Multi-Objective Evolutionary Algorithm for Phylogenetic Inference -- Convergence of Probability Collectives with Adaptive Choice of Temperature Parameters -- Generative Topographic Mapping for Dimension Reduction in Engineering Design -- Learning Decision Trees for the Analysis of Optimization Heuristics -- On the Coordination of Multidisciplinary Design Optimization Using Expert Systems -- On the Potentials of Parallelizing Large Neighbourhood Search for Rich Vehicle Routing Problems -- Optimized Ensembles for Clustering Noisy Data -- Stochastic Local Search for the Optimization of Secondary Structure Packing in Proteins -- Systematic Improvement of Monte-Carlo Tree Search with Self-generated Neural-Networks Controllers -- Special Session: LION-SWOP -- Grapheur: A Software Architecture for Reactive and Interactive Optimization -- The EvA2 Optimization Framework -- Special Session: LION-CCEC -- Feature Extraction from Optimization Data via DataModeler’s Ensemble Symbolic Regression -- Special Session: LION-PP -- Understanding TSP Difficulty by Learning from Evolved Instances -- Time-Bounded Sequential Parameter Optimization -- Pitfalls in Instance Generation for Udine Timetabling -- Special Session: LION-MOME -- A Study of the Parallelization of the Multi-Objective Metaheuristic MOEA/D -- An Interactive Evolutionary Multi-objective Optimization Method Based on Polyhedral Cones -- On the Distribution of EMOA Hypervolumes -- Adapting to a Realistic Decision Maker: Experiments towards a Reactive Multi-objective Optimizer. |
| Record Nr. | UNISA-996465620803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Wireless On-Demand Network Systems [[electronic resource] ] : First IFIP TC6 Working Conference, WONS 2004, Madonna di Campiglio, Italy, January 21-23, 2004, Proceedings / / edited by Roberto Battiti, Marco Conti, Renato Lo Cigno
| Wireless On-Demand Network Systems [[electronic resource] ] : First IFIP TC6 Working Conference, WONS 2004, Madonna di Campiglio, Italy, January 21-23, 2004, Proceedings / / edited by Roberto Battiti, Marco Conti, Renato Lo Cigno |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIV, 410 p.) |
| Disciplina | 004.165 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Electrical engineering
Computer communication systems Computer science Operating systems (Computers) Application software Personal computers Communications Engineering, Networks Computer Communication Networks Computer Science, general Operating Systems Information Systems Applications (incl. Internet) Personal Computing |
| ISBN |
1-280-30667-X
9786610306671 3-540-24614-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Localization and Mobility Management -- Markov Localization of Wireless Local Area Network Clients -- A Topology Based Localization in Ad Hoc Mobile Sensor Networks -- Grcmob: A Group Mobility Pattern Generator to Evaluate Mobile Ad Hoc Networks Performance -- Activity-Based User Modeling in Service-Oriented Ad-Hoc-Networks -- MAC and Radio Resource Management -- Media Access Control Schemes for Mobile Ad Hoc Networks -- Throughput Evaluation and Enhancement of TCP Clients in Wi-Fi Hot Spots -- An Adaptive IEEE 802.11 MAC in Multihop Wireless Ad Hoc Networks Considering Large Interference Range -- A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks -- Bluetooth Scatternets -- Locally Optimal Scatternet Topologies for Bluetooth Ad Hoc Networks -- An On-Demand Bluetooth Scatternet Formation Algorithm -- Ad Hoc Routing I -- GPS-Based Route Discovery Algorithms for On-Demand Routing Protocols in MANETs -- Dynamic AODV Backup Routing in Dense Mobile Ad-Hoc Networks -- Multipath Power Sensitive Routing Protocol for Mobile Ad Hoc Networks -- Security, Applications, and Service Support -- Dependable and Secure Data Storage in Wireless Ad Hoc Networks: An Assessment of DS2 -- A Comparative Analysis on Performance of Mobile IP with Paging Support -- Preventive and Corrective Protection for Mobile Ad Hoc Network Routing Protocols -- Dynamic Service Adaptation for Runtime System Extensions -- Ad Hoc Routing II -- Flood Filtering and Route Selection for Energy-Efficient On-Demand Routing in Wireless Ad Hoc Networks -- High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks -- A Three-Tier Framework Supporting Soft QoS Routing in MANET -- MAC Analytical Models -- Achieving Maximum Throughput and Service Differentiation by Enhancing the IEEE 802.11 MAC Protocol -- Throughput of the Multi-hop Slotted Aloha with Multi-packet Reception -- On Demand Internet Access -- WIDE: Wireless Information Delivery Environment in Distributed Hot Spots -- Smart Wireless Access Points for Pervasive Computing -- NAT-Based Internet Connectivity for On-Demand Ad Hoc Networks -- Poster Session -- Efficient Management of Domain Foreign Agents in Mobile Computing Environment Using Load Balance -- Node Synchronization Based Redundant Routing for Mobile Ad-Hoc Networks -- A New Backoff Algorithm to Guarantee Quality of Service over IEEE 802.11 Wireless Local Area Networks -- A Light Protocol for Distance Estimation in Bluetooth Mobile Ad-Hoc Networks -- Access Router Discovery and Selection in Advanced Wireless Networks -- Enhancing HIPERLAN/2 Security Aspects -- Analytical Modeling of a Traffic Differentiation Strategy for 802.11. |
| Record Nr. | UNISA-996465786003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Wireless On-Demand Network Systems : First IFIP TC6 Working Conference, WONS 2004, Madonna di Campiglio, Italy, January 21-23, 2004, Proceedings / / edited by Roberto Battiti, Marco Conti, Renato Lo Cigno
| Wireless On-Demand Network Systems : First IFIP TC6 Working Conference, WONS 2004, Madonna di Campiglio, Italy, January 21-23, 2004, Proceedings / / edited by Roberto Battiti, Marco Conti, Renato Lo Cigno |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIV, 410 p.) |
| Disciplina | 004.165 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Electrical engineering
Computer networks Computer science Operating systems (Computers) Application software Microcomputers Communications Engineering, Networks Computer Communication Networks Computer Science, general Operating Systems Information Systems Applications (incl. Internet) Personal Computing |
| ISBN |
1-280-30667-X
9786610306671 3-540-24614-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Localization and Mobility Management -- Markov Localization of Wireless Local Area Network Clients -- A Topology Based Localization in Ad Hoc Mobile Sensor Networks -- Grcmob: A Group Mobility Pattern Generator to Evaluate Mobile Ad Hoc Networks Performance -- Activity-Based User Modeling in Service-Oriented Ad-Hoc-Networks -- MAC and Radio Resource Management -- Media Access Control Schemes for Mobile Ad Hoc Networks -- Throughput Evaluation and Enhancement of TCP Clients in Wi-Fi Hot Spots -- An Adaptive IEEE 802.11 MAC in Multihop Wireless Ad Hoc Networks Considering Large Interference Range -- A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks -- Bluetooth Scatternets -- Locally Optimal Scatternet Topologies for Bluetooth Ad Hoc Networks -- An On-Demand Bluetooth Scatternet Formation Algorithm -- Ad Hoc Routing I -- GPS-Based Route Discovery Algorithms for On-Demand Routing Protocols in MANETs -- Dynamic AODV Backup Routing in Dense Mobile Ad-Hoc Networks -- Multipath Power Sensitive Routing Protocol for Mobile Ad Hoc Networks -- Security, Applications, and Service Support -- Dependable and Secure Data Storage in Wireless Ad Hoc Networks: An Assessment of DS2 -- A Comparative Analysis on Performance of Mobile IP with Paging Support -- Preventive and Corrective Protection for Mobile Ad Hoc Network Routing Protocols -- Dynamic Service Adaptation for Runtime System Extensions -- Ad Hoc Routing II -- Flood Filtering and Route Selection for Energy-Efficient On-Demand Routing in Wireless Ad Hoc Networks -- High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks -- A Three-Tier Framework Supporting Soft QoS Routing in MANET -- MAC Analytical Models -- Achieving Maximum Throughput and Service Differentiation by Enhancing the IEEE 802.11 MAC Protocol -- Throughput of the Multi-hop Slotted Aloha with Multi-packet Reception -- On Demand Internet Access -- WIDE: Wireless Information Delivery Environment in Distributed Hot Spots -- Smart Wireless Access Points for Pervasive Computing -- NAT-Based Internet Connectivity for On-Demand Ad Hoc Networks -- Poster Session -- Efficient Management of Domain Foreign Agents in Mobile Computing Environment Using Load Balance -- Node Synchronization Based Redundant Routing for Mobile Ad-Hoc Networks -- A New Backoff Algorithm to Guarantee Quality of Service over IEEE 802.11 Wireless Local Area Networks -- A Light Protocol for Distance Estimation in Bluetooth Mobile Ad-Hoc Networks -- Access Router Discovery and Selection in Advanced Wireless Networks -- Enhancing HIPERLAN/2 Security Aspects -- Analytical Modeling of a Traffic Differentiation Strategy for 802.11. |
| Record Nr. | UNINA-9910144213703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||