close
1.

電子ブック

EB
edited by Grzegorz Rozenberg, Arto Salomaa, Jose M. Sempere, Claudio Zandron
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9504
オンライン: http://dx.doi.org/10.1007/978-3-319-28475-0
目次情報: 続きを見る
Information Theory in Genome Analysis
Towards a Theory of Life
An Excursion through Quantitative Model Refinement
Polarizationless P Systems with One Active Membrane
Bridging Deterministic P Systems and Conditional Grammars
Automated Verification of Stochastic Spiking Neural P Systems
Dynamically Changing Environment for Generalized Communicating P Systems
Spiking Neural P Systems with Structural Plasticity: Attacking the Subset Sum Problem
P Systems with Generalized Multisets over Totally Ordered Abelian Groups
On the Power of Catalytic P Systems with One Catalyst
An Integrated Model Checking Toolset for Kernel P Systems
A New Strategy to Improve the Performance of PDP-systems Simulators
Automatic Translation of MP+V Systems to Register Machines
On the Communication Complexity of the Vertex Cover Problem and 3-Satisfiability Problem in ECP systems
Membrane Computing Meets Temperature: A Thermoreceptor Model as Molecular Slide Rule with Evolutionary Potential
A Solution of Horn-SAT with P Systems Using Antimatter
Tissue P systems can be Simulated Efficiently with Counting Oracles
Simulating FRSN P systems with real numbers in P-Lingua on sequential and CUDA platforms
Pictures and Chomsky Languages in Array P System
Sorting Using Spiking Neural P Systems with Anti-Spikes and Rules on Synapses
Regulating Rule Application with Membrane Boundaries in P Systems
Structured Grid Algorithms Modelled with Complex Objects
Chemistry-inspired Adaptive Stream Processing
Computing Partial Recursive Functions by Virus Machines
About models derived from colonies
Information Theory in Genome Analysis
Towards a Theory of Life
An Excursion through Quantitative Model Refinement
2.

電子ブック

EB
edited by Magnus M. Halldorsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9134
オンライン: http://dx.doi.org/10.1007/978-3-662-47672-7
目次情報: 続きを見る
Statistical Randomized Encodings: A Complexity Theoretic View
Tighter Fourier Transform Lower Bounds
Quantifying Competitiveness in Paging with Locality of Reference
Approximation Algorithms for Computing Maximin Share Allocations
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare
Batched Point Location in SINR Diagrams via Algebraic Tools
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-uniform Costs
Serving in the Dark Should Be Done Non-uniformly
Finding the Median (Obliviously) with Bounded Space
Approximation Algorithms for Min-Sum k-Clustering
Solving Linear Programming with Constraints Unknown
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources
Limitations of Algebraic Approaches to Graph Isomorphism Testing
Fully Dynamic Matching in Bipartite Graphs
Feasible Interpolation for QBF Resolution Calculi
Simultaneous Approximation of Constraint Satisfaction Problems
Design of Dynamic Algorithms via Primal-Dual Method
What Percentage of Programs Halt?
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems
Spotting Trees with Few Leaves
Constraint Satisfaction Problems over the Integers with Successor
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits
Algorithms and Complexity for Turaev-Viro Invariants
Big Data on the Rise? ? Testing Monotonicity of Distributions
Unit Interval Editing Is Fixed-Parameter Tractable
Streaming Algorithms for Submodular Function Maximization
Multilinear Pseudorandom Functions
Zero-Fixing Extractors for Sub-Logarithmic Entropy
Interactive Proofs with Approximately Commuting Provers
Popular Matchings with Two-Sided Preferences and One-Sided Ties
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols
Scheduling Bidirectional Traffic on a Path
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace
On Planar Boolean CSP
On Temporal Graph Exploration
Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation
A (1+e)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
Lower Bounds for the Graph Homomorphism Problem
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree
Relative Discrepancy Does not Separate Information and Communication Complexity
A Galois Connection for Valued Constraint Languages of Infinite Size
Approximately Counting H Colourings Is #BIS-Hard
Taylor Polynomial Estimator for Estimating Frequency Moments
ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search
Optimal Encodings for Range Top-k, Selection, and Min-Max
2-Vertex Connectivity in Directed Graphs
Ground State Connectivity of Local Hamiltonians
Uniform Kernelization Complexity of Hitting Forbidden Minors
Counting Homomorphisms to Square-Free Graphs, Modulo 2
Approximately Counting Locally-Optimal Structures
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Extended Abstract)
Fast Algorithms for Diameter-Optimally Augmenting Paths
Hollow Heaps
Linear-Time List Recovery of High-Rate Expander Codes
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities
Local Reductions
Query Complexity in Expectation
Near-Linear Query Complexity for Graph Inference
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden
Lower Bounds for Sums of Powers of Low Degree Univariates
Approximating CSPs Using LP Relaxation
Comparator Circuits over Finite Bounded Posets
Algebraic Properties of Valued Constraint Satisfaction Problem
Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
Replacing Mark Bits with Randomness in Fibonacci Heaps
A PTAS for the Weighted Unit Disk Cover Problem
Approximating the Expected Values for Combinatorial Optimization Problems Over Stochastic Points
Deterministic Truncation of Linear Matroids
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity
A (2+e)-Approximation Algorithm for the Storage Allocation Problem
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
Computing the Frechet Distance Between Polygons with Holes
An Improved Private Mechanism for Small Databases
Binary Pattern Tile Set Synthesis Is NP-Hard
Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity
Condensed Unpredictability
Sherali-Adams Relaxations for Valued CSPs
Two-Sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
The Simultaneous Communication of Disjointness with Applications to Data Streams
An Improved Combinatorial Algorithm for Boolean Matrix Multiplication
Statistical Randomized Encodings: A Complexity Theoretic View
Tighter Fourier Transform Lower Bounds
Quantifying Competitiveness in Paging with Locality of Reference
3.

電子ブック

EB
edited by Antonio Gaspar-Cunha, Carlos Henggeler Antunes, Carlos Coello Coello
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9018
オンライン: http://dx.doi.org/10.1007/978-3-319-15934-8
目次情報: 続きを見る
Plenary Talks
Interactive Approaches in Multiple Criteria Decision Making and Evolutionary Multi-objective Optimization
Towards Automatically Configured Multi-objective Optimizers
A Review of Evolutionary Multiobjective Optimization Applications in Aerospace Engineering
Performance evaluation of multiobjective optimization algorithms: quality indicators and the attainment function
Theory and Hyper-Heuristics
A Multimodal Approach for Evolutionary Multi-objective Optimization (MEMO): Proof-of-Principle Results
Unwanted Feature Interactions Between the Problem and Search Operators in Evolutionary Multi-objective Optimization
Neutral but a Winner! How Neutrality helps Multiobjective Local Search Algorithms
To DE or not to DE? Multi-Objective Differential Evolution Revisited from a Component-Wise Perspective
Model-Based Multi-Objective Optimization: Taxonomy, Multi-Point Proposal, Toolbox and Benchmark
Temporal Innovization: Evolution of Design Principles Using Multi-objective ?Optimization
MOEA/D-HH: A Hyper-Heuristic for Multi-objective Problems
Using hyper-heuristic to select leader and archiving methods for many-objective problems
Algorithms
Adaptive Reference Vector Generation for Inverse Model Based Evolutionary Multiobjective Optimization with Degenerate and Disconnected Pareto Fronts
MOEA/PC: Multiobjective Evolutionary Algorithm Based on Polar Coordinates
GD-MOEA: A New Multi-Objective Evolutionary Algorithm based on the Generational Distance Indicator
Experiments on Local Search for Bi-objective Unconstrained Binary Quadratic Programming
A Bug in the Multiobjective Optimizer IBEA: Salutary Lessons for Code Release and a Performance Re-Assessment
A Knee-based EMO Algorithm with an Efficient Method to Update Mobile Reference Points
A Hybrid Algorithm for Stochastic Multiobjective Programming Problem
Parameter Tuning of MOEAs using a Bilevel Optimization Approach
Pareto adaptive scalarising functions for decomposition based algorithms
A bi-level multiobjective PSO algorithm
An interactive simple indicator-based evolutionary algorithm (I-SIBEA) for multiobjective optimization problems
Combining Non-dominance, Objective-sorted and Spread Metric to Extend Firefly Algorithm to Multi-objective Optimization
GACO: a parallel evolutionary approach to multi-objective scheduling
Kriging Surrogate Model Enhanced by Coordinate Transformation of Design Space Based on Eigenvalue Decomposition
A Parallel Multi-Start NSGA II Algorithm for Multiobjective Energy Reduction Vehicle Routing Problem
Evolutionary Inference of Attribute-based Access Control Policies
Hybrid Dynamic Resampling for Guided Evolutionary Multi-Objective Optimization
A Comparison of Decoding Strategies for the 0/1 Multi-objective Unit Commitment Problem
Comparing Decomposition-based and Automatically Component-Wise Designed Multi-objective Evolutionary Algorithms
Upper Confidence Bound (UCB) Algorithms for Adaptive Operator Selection in MOEA/D
Towards Understanding Bilevel Multi-objective Optimization with Deterministic Lower Level Decisions
Plenary Talks
Interactive Approaches in Multiple Criteria Decision Making and Evolutionary Multi-objective Optimization
Towards Automatically Configured Multi-objective Optimizers
4.

電子ブック

EB
edited by Gabriela Ochoa, Francisco Chicano
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9026
オンライン: http://dx.doi.org/10.1007/978-3-319-16468-7
目次情報: 続きを見る
A Biased Random-Key Genetic Algorithm for the Cloud Resource Management Problem
A Computational Comparison of Different Algorithms for Very Large p-median Problems
A New Solution Representation for the Firefighter Problem
A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem
A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands
An Iterated Local Search Algorithm for Solving the Orienteering Problem with Time Windows
Analysis of Solution Quality of a Multi objective Optimization-Based Evolutionary Algorithm for Knapsack Problem
Evolving Deep Recurrent Neural Networks Using Ant Colony Optimization
Hyper-heuristic Operator Selection and Acceptance Criteria
Improving the Performance of the Germinal Center Artificial Immune System Using ε-Dominance: A Multi-objective Knapsack Problem
Mixing Network Extremal Optimization for Community Structure Detection
Multi-start Iterated Local Search for the Mixed Fleet Vehicle Routing Problem with Heterogeneous Electric Vehicles
On the Complexity of Searching the Linear Ordering Problem Neighborhoods
Runtime Analysis of (1 + 1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on ONEMAX+ZEROMAX Problem
The New Memetic Algorithm HEAD for Graph Coloring: An Easy Way for Managing Diversity
The Sim-EA Algorithm with Operator Auto adaptation for the Multi objective Firefighter Problem
True Pareto Fronts for Multi-objective AI Planning Instances
Upper and Lower Bounds on Unrestricted Black-Box Complexity of JUMPn,l
Using Local Search to Evaluate Dispatching Rules in Dynamic Job Shop Scheduling
A Biased Random-Key Genetic Algorithm for the Cloud Resource Management Problem
A Computational Comparison of Different Algorithms for Very Large p-median Problems
A New Solution Representation for the Firefighter Problem
5.

電子ブック

EB
edited by Penousal Machado, Malcolm I. Heywood, James McDermott, Mauro Castelli, Pablo Garcia-Sanchez, Paolo Burelli, Sebastian Risi, Kevin Sim
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9025
オンライン: http://dx.doi.org/10.1007/978-3-319-16501-1
目次情報: 続きを見る
The Effect of Distinct Geometric Semantic Crossover Operators in Regression Problems
Learning Text Patterns Using Separate-and-Conquer Genetic Programming
Improving Geometric Semantic Genetic Programming with Safe Tree Initialisation
Grant Dick On the Generalization Ability of Geometric Semantic Genetic Programming
Automatic Derivation of Search Objectives for Test-Based Genetic Programming
Evolutionary Design of Transistor Level Digital Circuits Using Discrete Simulation
M3GP ? Multiclass Classification with GP
Evolving Ensembles of Dispatching Rules Using Genetic Programming for Job Shop Scheduling
Attributed Grammatical Evolution Using Shared Memory Spaces and Dynamically Typed Semantic Function Specification
Indirectly Encoded Fitness Predictors Coevolved with Cartesian Programs
Tapped Delay Lines for GP Streaming Data Classification with Label Budgets
Cartesian GP in Optimization of Combinational Circuits with Hundreds of Inputs and Thousands of Gates
Genetic Programming for Feature Selection and Question-Answer Ranking in IBM Watson
Automatic Evolution of Parallel Recursive Programs
Proposal and Preliminary Investigation of a Fitness Function for Partial Differential Models
Evolutionary Methods for the Construction of Cryptographic Boolean Functions
TEMPLAR ? A Framework for Template-Method Hyper-Heuristics
Circuit Approximation Using Single- and Multi-objective Cartesian GP
The Effect of Distinct Geometric Semantic Crossover Operators in Regression Problems
Learning Text Patterns Using Separate-and-Conquer Genetic Programming
Improving Geometric Semantic Genetic Programming with Safe Tree Initialisation
6.

電子ブック

EB
edited by Andrew Phillips, Peng Yin
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9211
オンライン: http://dx.doi.org/10.1007/978-3-319-21999-8
目次情報: 続きを見る
Algorithms and models for computation on biomolecular Systems
Computational processes in vitro and in vivo
Molecular switches, gates, devices, and circuits
Molecular folding and self-assembly of nanostructures
Analysis and theoretical models of laboratory techniques
Molecular motors and molecular robotics
Studies of fault-tolerance and error correction
Software tools for analysis, simulation, and design
Synthetic biology and in vitro Evolution
Applications in engineering, physics, chemistry, biology, and medicine
Algorithms and models for computation on biomolecular Systems
Computational processes in vitro and in vivo
Molecular switches, gates, devices, and circuits
7.

電子ブック

EB
edited by Laura Sanita, Martin Skutella
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9499
オンライン: http://dx.doi.org/10.1007/978-3-319-28684-6
目次情報: 続きを見る
Algorithmic game theory
Algorithmic trading
Coloring and partitioning
Competitive analysis
Computational advertising
Computational finance
Cuts and connectivity
Geometric problems
Graph algorithms
Inapproximability
Mechanism design
Natural algorithms
Network design
Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. -Real-world applications
Algorithmic game theory
Algorithmic trading
Coloring and partitioning
8.

電子ブック

EB
edited by Adrian-Horia Dediu, Enrico Formenti, Carlos Martin-Vide, Bianca Truthe
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8977
オンライン: http://dx.doi.org/10.1007/978-3-319-15579-1
目次情報: 続きを見る
Algorithms
Automata, Logic, and Concurrency
Codes, Semigroups, and Symbolic Dynamics
Combinatorics on Words
Complexity and Recursive Functions
Compression, Inference, Pattern Matching, and Model Checking
Graphs, Term Rewriting, and Networks
Transducers, Tree Automata, and Weighted Automata
Algorithms
Automata, Logic, and Concurrency
Codes, Semigroups, and Symbolic Dynamics
9.

電子ブック

EB
edited by Antonio Gaspar-Cunha, Carlos Henggeler Antunes, Carlos Coello Coello
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9019
オンライン: http://dx.doi.org/10.1007/978-3-319-15892-1
目次情報: 続きを見る
Many-Objectives Optimization, Performance and Robustness
Evolutionary Many-objective Optimization based on Kuhn-Munkres’ Algorithm
A KKT Proximity Measure for Evolutionary Multi-Objective and Many-Objective Optimization
U-NSGA-III: A Unified Evolutionary Optimization Procedure for Single, Multiple, and Many Objectives ? Proof-of- Principle Results
Clustering based parallel Many-objective Evolutionary Algorithms using the shape of the objective vectors
Faster Exact Algorithms for Computing Expected Hypervolume Improvement
A GPU-based Algorithm for a Faster Hypervolume Contribution Computation
A Feature-based Performance Analysis in Evolutionary Multiobjective Optimization
Modified Distance Calculation in Generational Distance and Inverted Generational Distance
On the Behavior of Stochastic Local Search within Parameter Dependent MOPs
An Evolutionary Approach to Active Robust Multiobjective Optimisation
Linear scalarization Pareto front identification in stochastic environments
Elite Accumulative Sampling Strategies for Noisy Multi-Objective Optimisation
Guideline Identification for Optimization under Uncertainty through the Optimization of a Boomerang Trajectory
MCDM
Using indifference information in robust ordinal regression
A Multi-objective genetic algorithm for inferring inter-criteria parameters for water supply consensus
Genetic Algorithm Approach for a Class of Multi-criteria, Multi-vehicle Planner of UAVs
An Interactive Evolutionary Multiobjective Optimization Method: Interactive WASF-GA
On Generalizing Lipschitz Global Methods for Multiobjective Optimization
Dealing with scarce optimization time in complex logistics optimization: A study on the biobjective Swap-Body Inventory Routing Problem
Machine Decision Makers as a Laboratory for Interactive EMO
Real World Applications
Aircraft Air Inlet Design Optimization via Surrogate-Assisted Evolutionary Computation
Diesel Engine Drive-Cycle Optimization with the Integrated Optimization Environment ? Liger
Re-design for robustness: An approach based on many objective optimization
A Model for a Human Decision-Maker in a Polymer Extrusion Process
Multi-Objective Optimization of Gate Location and Processing Conditions in Injection Molding Using MOEAs: Experimental Assessment
A Multi-Criteria Decision Support System for a Routing Problem in Waste Collection
Application of Evolutionary Multiobjective Algorithms for solving the problem of Energy Dispatch in Hydroelectric Power Plants
Solutions in Under 10 Seconds for Vehicle Routing Problems with Time Windows using Commodity Computers
A comparative study of algorithms for solving the Multiobjective Open-Pit Mining Operational Planning Problems
A Model to Select a Portfolio of Multiple Spare Parts for a Public Bus Transport Service Using NSGA II.-A Multi-Objective Optimization Approach Associated to Climate Change Analysis to Improve Systematic Conservation Planning
Marginalization in Mexico: An Application of the Electre III[Pleaseinsertintopreamble]MOEA Methodology
Integrating Hierarchical Clustering and Pareto-Efficacy to Preventive Controls Selection in Voltage Stability Assessment
Multi-objective Evolutionary Algorithm with Discrete Differential Mutation Operator for Service Restoration in Largescale
Distribution Systems
Combining Data Mining and Evolutionary Computation for Multi-Criteria Optimization of Earthworks
Exploration of Two-Objective Scenarios on Supervised Evolutionary Feature Selection: a Survey and a Case Study
(Application to Music Categorisation)
A Multi-Objective Approach for Building Hyperspectral Remote Sensed Image Classifier Combiners
Multi-Objective Optimization of Barrier Coverage with Wireless Sensors
Comparison of Single and Multi-objective Evolutionary Algorithms for Robust Link-state Routing
Many-Objectives Optimization, Performance and Robustness
Evolutionary Many-objective Optimization based on Kuhn-Munkres’ Algorithm
A KKT Proximity Measure for Evolutionary Multi-Objective and Many-Objective Optimization
10.

電子ブック

EB
edited by Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8996
オンライン: http://dx.doi.org/10.1007/978-3-319-18812-6
目次情報: 続きを見る
Complexity of One-Way Cellular Automata
Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal
A Universal Cellular Automaton Without Sensitive Subsystems
Real-Time Reversible One-Way Cellular Automata
Cycle Equivalence of Finite Dynamical Systems Containing Symmetries
Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces
Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results
Rapaport Language Recognition by Reversible Partitioned Cellular Automata
Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2
Plane-Walking Automata
Complexity of One-Way Cellular Automata
Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal