Sciweavers

4217 search results - page 756 / 844
» Computational indistinguishability logic
Sort
View
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
14 years 11 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
ICFP
2010
ACM
14 years 11 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier
BMCBI
2010
109views more  BMCBI 2010»
14 years 10 months ago
FPGA acceleration of the phylogenetic likelihood function for Bayesian MCMC inference methods
Background: Likelihood (ML)-based phylogenetic inference has become a popular method for estimating the evolutionary relationships among species based on genomic sequence data. Th...
Stephanie Zierke, Jason D. Bakos
CORR
2010
Springer
176views Education» more  CORR 2010»
14 years 10 months ago
Abstraction for Epistemic Model Checking of Dining Cryptographers-based Protocols
ion for Epistemic Model Checking of Dining Cryptographers-based Protocols Omar I. Al-Bataineh and Ron van der Meyden School of Computer Science and Engineering, University of New S...
Omar I. Al-Bataineh, Ron van der Meyden
CORR
2008
Springer
179views Education» more  CORR 2008»
14 years 10 months ago
Induction and Co-induction in Sequent Calculus
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
Alwen Tiu, Alberto Momigliano