1331 search results - page 162 / 267 » Complexity bounds for zero-test algorithms |
PODS
2010
ACM
15 years 3 months ago
2010
ACM
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
We present novel algorithms for parallel testing of code that takes structurally complex test inputs. The algorithms build on the Korat algorithm for constraint-based generation o...
KDD
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
PPDP
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we present a new type system for logic programs. Our system combines ideas of the classical polymorphic, but not very precise, system due to Mycroft and O'Keefe...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...