6274 search results - page 164 / 1255 » Proofs, Programs, Processes |
269
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
Modern applications are designed in multiple tiers to separate concerns. Since each tier may run at a separate location, middleware is required to mediate access between tiers. Ho...
163
click to vote
JMLR
2002
15 years 6 months ago
2002
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
185
click to vote
NMR
2004
Springer
15 years 11 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
174
click to vote
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
158
click to vote
TCS
2008
15 years 6 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...