Optimal policy computation with Dynare - MONFISPOL workshop, Stresa

Source URL: www.monfispol.eu

Finding Robust Strategies to Defeat Specific Opponents Using Case-Injected Coevolution Christopher Ballinger and Sushil Louis University of Nevada, Reno Reno, Nevada 89503 {caballinger, sushil}@cse.unr.edu

Source URL: eldar.mathstat.uoguelph.ca

• Gaming
• Game theory
• Cybernetics
• Video game genres
• Evolution
• Genetic algorithm
• Coevolution
• Strategy
• Real-time strategy
• The Evolution of Cooperation
• Evolutionary computation
• Evolutionary algorithm

A Population-Differential Method of Moni toring Success and Failure in Coevolution Ari Bader-Natal and Jordan B. Pollack. DEMO Lab Dept. of Computer Science, Brandeis University, Waltham, MAThe task of monitoring

Source URL: aribadernatal.com

• Biology
• Evolutionary biology
• Nature
• Mathematical optimization
• Coevolution
• Habitat
• Cybernetics
• Evolutionary computation
• Genetic algorithm
• Red Queen hypothesis
• Evolutionary robotics
• Evolution

Is Bioinformatics Possible? Philosophical problems and opportunities Johan Nyström-Persson, Level Five Co., Ltd and Australia-China Centre for Wheat Improvement

Source URL: www.monomorphic.org

• Theoretical computer science
• Alan Turing
• Computability theory
• Mathematics
• Software engineering
• Formal methods
• Models of computation
• Turing machine
• Turing
• Lambda calculus
• Affymetrix
• Computer science

DOC Document

Source URL: www.sigevo.org

• Evolutionary algorithms
• Evolutionary computation
• Mathematical optimization
• Artificial intelligence
• Applied mathematics
• Theoretical computer science
• Cybernetics
• Genetic algorithms
• Genetic and Evolutionary Computation Conference
• Riccardo Poli
• Genetic programming
• Genetic representation

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

Source URL: www.crypto.ethz.ch

• Cryptography
• Computational complexity theory
• Theory of computation
• Complexity classes
• Probabilistic complexity theory
• Public-key cryptography
• NP
• IP
• Proof of knowledge
• Zero-knowledge proof
• Random oracle
• FiatShamir heuristic

Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk

Source URL: www.bedewell.com

• Computational complexity theory
• Theory of computation
• Theoretical computer science
• NP-complete problems
• Complexity classes
• Logic in computer science
• Finite model theory
• Parameterized complexity
• Resolution
• Exponential time hypothesis
• Boolean satisfiability problem
• Conjunctive normal form

Genetic Algorithms: A Tutorial “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating

Source URL: www.csd.uwo.ca

• Genetic algorithms
• Cybernetics
• Applied mathematics
• Mathematical optimization
• Search algorithms
• Cognitive science
• Numerical analysis
• Machine learning
• Genetic operator
• Crossover
• Chromosome
• Evolutionary computation

A PTAS for the Highway Problem Fabrizio Grandoni & Thomas Rothvo Institute of Mathemati s EPFL, Lausanne The Highway Problem

Source URL: www.math.washington.edu

• Computational complexity theory
• Complexity classes
• Theory of computation
• Polynomial-time approximation scheme
• APX
• Strong NP-completeness
• NP

Privacy-Preserving Computation (Position Paper) Florian Kerschbaum SAP Research Karlsruhe, Germany

Source URL: www.fkerschbaum.org

• Cryptography
• Public-key cryptography
• Homomorphic encryption
• Secure multi-party computation
• Cryptographic protocol
• Paillier cryptosystem
• Privacy
• Digital signature
• Internet privacy
• Zero-knowledge proof
• Encryption
• Cloud computing security