Sciweavers

16 search results - page 3 / 4
» Adding Skolem functions to simple theories
Sort
View
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
14 years 1 months ago
Towards billion-bit optimization via a parallel estimation of distribution algorithm
This paper presents a highly efficient, fully parallelized implementation of the compact genetic algorithm (cGA) to solve very large scale problems with millions to billions of va...
Kumara Sastry, David E. Goldberg, Xavier Llor&agra...
ICFP
2008
ACM
14 years 7 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
UPP
2004
Springer
14 years 28 days ago
Grassroots Approach to Self-management in Large-Scale Distributed Systems
Abstract. Traditionally, autonomic computing is envisioned as replacing the human factor in the deployment, administration and maintenance of computer systems that are ever more co...
Özalp Babaoglu, Márk Jelasity, Alberto...
ENTCS
2007
95views more  ENTCS 2007»
13 years 7 months ago
Hybridizing a Logical Framework
Logical connectives familiar from the study of hybrid logic can be added to the logical framework LF, a constructive type theory of dependent functions. This extension turns out t...
Jason Reed
POPL
2006
ACM
14 years 8 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao