Sciweavers

63 search results - page 7 / 13
» The Schema Theorem and Price's Theorem
Sort
View
ASE
2005
140views more  ASE 2005»
13 years 7 months ago
Automated Procedure Construction for Deductive Synthesis
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...
Steve Roach, Jeffrey Van Baalen
PODS
2008
ACM
165views Database» more  PODS 2008»
14 years 7 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
SIAMCO
2000
111views more  SIAMCO 2000»
13 years 7 months ago
Superreplication Under Gamma Constraints
In a financial market consisting of a nonrisky asset and a risky one, we study the minimal initial capital needed in order to superreplicate a given contingent claim under a gamma ...
H. Mete Soner, Nizar Touzi
CEC
2005
IEEE
14 years 1 months ago
Theoretical analysis of generalised recombination
In this paper we propose, model theoretically and study a general notion of recombination for fixed-length strings where homologous crossover, inversion, gene duplication, gene d...
Riccardo Poli, Christopher R. Stephens
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
13 years 11 months ago
Improved Approximations of Independent Sets in Bounded-Degree Graphs
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
Magnús M. Halldórsson, Jaikumar Radh...