Sciweavers

2780 search results - page 66 / 556
» Generalizing by Removing Detail
Sort
View
ENTCS
2002
129views more  ENTCS 2002»
15 years 6 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
OOPSLA
2010
Springer
15 years 5 months ago
Programming with time: cyber-physical programming with impromptu
The act of computer programming is generally considered to be temporally removed from a computer program’s execution. In this paper we discuss the idea of programming as an acti...
Andrew Sorensen, Henry Gardner
JSAT
2010
130views more  JSAT 2010»
15 years 1 months ago
DepQBF: A Dependency-Aware QBF Solver
We present DepQBF 0.1, a new search-based solver for quantified boolean formulae (QBF). It integrates compact dependency graphs to overcome the restrictions imposed by linear quan...
Florian Lonsing, Armin Biere
AAAI
2011
14 years 6 months ago
Controlling Selection Bias in Causal Inference
Selection bias, caused by preferential exclusion of samples from the data, is a major obstacle to valid causal and statistical inferences; it cannot be removed by randomized exper...
Elias Bareinboim, Judea Pearl
VIZSEC
2004
Springer
16 years 1 days ago
PortVis: a tool for port-based detection of security events
Most visualizations of security-related network data require large amounts of finely detailed, high-dimensional data. However, in some cases, the data available can only be coars...
Jonathan McPherson, Kwan-Liu Ma, Paul Krystosk, To...