Computation - PDFSEARCH.IO - Document Search Engine

Computation
Results: 6765

#	Item
581	A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility Add to Reading List Source URL: tandy.cs.illinois.edu Language: English - Date: 2015-04-08 19:35:45 Computational complexity theory Theory of computation Complexity classes NP-complete problems Combinatorial optimization Packing problems Approximation algorithms Knapsack problem NP APX
582	Efficient Optimization of Many Objectives by Approximation-Guided Evolution Markus Wagnerc,∗, Karl Bringmanna , Tobias Friedrichb , Frank Neumannc a Max-Planck-Institut f¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:47 Mathematical optimization Computational complexity theory Theory of computation Applied mathematics Academia Evolutionary algorithms Operations research Cybernetics Multi-objective optimization Reduction Algorithm CMA-ES
583	Deterministic Anytime Inference for Stochastic Continuous-Time Markov Processes E. Busra Celikkaya University of California, Riverside CELIKKAE @ CS . UCR . EDU Add to Reading List Source URL: rlair.cs.ucr.edu Language: English - Date: 2015-05-14 15:50:46 Graphical models Statistics Applied mathematics Mathematics Estimation theory Bayesian network Networks Gibbs sampling Belief propagation Expectationmaximization algorithm Computation tree
584	COMMENTARY Considerations of thin and fat Technological innovations Add to Reading List Source URL: uaw5810.org Language: English - Date: 2013-03-18 20:39:32 Academia Postdoctoral research Mathematics Theoretical computer science Education Computability theory National Postdoctoral Association Turing machine Models of computation UAW Local Alan Turing Community
585	Estimation d’arrondis, analyse de stabilité des grands codes de calcul numérique Jean-Marie Chesneaux, Fabienne Jézéquel, Jean-Luc Lamotte, Jean Vignes Laboratoire d’Informatique de Paris 6, P. and M. Curie Unive Add to Reading List Source URL: www.gdr-mascotnum.fr Language: English Computer arithmetic Mathematics Arithmetic Numerical analysis Computing Theoretical computer science IEEE standards Rounding Theory of computation Precision Signed zero Associative property
586	Surprise Search: Beyond Objectives and Novelty Daniele Gravina Antonios Liapis Georgios N. Yannakakis Add to Reading List Source URL: antoniosliapis.com Language: English - Date: 2016-04-14 10:52:19 Applied mathematics Academia Cognitive science Cybernetics Evolution Mathematical optimization Machine learning Search algorithms Genetic algorithm Maze solving algorithm Evolutionary algorithm Evolutionary computation
587	Kagan Tumer Nomination for the IFAAMAS BOARDKagan Tumer is a Professor at Oregon State University, and the director of the multidisciplinary Graduate Robotics Program (OSU is one of only five universities in the Add to Reading List Source URL: www.aamas-conference.org Language: English - Date: 2016-03-14 20:09:08 Artificial intelligence International Conference on Autonomous Agents and Multiagent Systems Systems science Multi-agent systems Academia Models of computation International Conference On Intelligent Robots and Systems Agent-based model
588	Special Session on Swarm Intelligence and Applications Organisers:  Dr. Ben Niu Add to Reading List Source URL: www.ies-2016.org Language: English - Date: 2016-05-19 03:42:30 Mathematical optimization Higher education in China Evolution Academia Collective intelligence Swarm intelligence Applied mathematics Global optimization Ant colony optimization algorithms Multi-objective optimization Evolutionary computation Swarm behaviour
589	Noname manuscript No. (will be inserted by the editor) Relational Analysis of (Co)inductive Predicates, (Co)algebraic Datatypes, and (Co)recursive Functions Jasmin Christian Blanchette Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-01-25 16:18:54 Mathematical logic Logic Model theory Mathematics Computability theory Models of computation Formal languages Lambda calculus Theoretical computer science First-order logic Structure Interpretation
590	The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2003-12-08 11:12:51 Computational complexity theory Theory of computation Mathematics Complexity classes Computational problems Theoretical computer science Structural complexity theory Tutte polynomial NP Quantum computing Time complexity Reduction

UPDATE