4743 search results - page 108 / 949 » The PlusCal Algorithm Language |
147
click to vote
COCO
2010
Springer
15 years 6 months ago
2010
Springer
—We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symm...
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
We show that a natural online algorithm for scheduling jobs on a heterogeneous multiprocessor, with arbitrary power functions, is scalable for the objective function of weighted ï¬...
89
Voted
COCO
2006
Springer
15 years 6 months ago
2006
Springer
We may believe SAT does not have small Boolean circuits. But is it possible that some language with small circuits looks indistiguishable from SAT to every polynomialtime bounded ...
DLOG
2006
15 years 3 months ago
2006
The goal of this paper is to present how the Prolog Technology Theorem Proving (PTTP) approach can be used for ABox-reasoning. This work presents an inference algorithm over the l...
COLING
1996
15 years 3 months ago
1996
We present an approach to parallel natural language parsing which is based on a concurrent, object-oriented model of computation. A depth-first, yet incomplete parsing algorithm f...