Nothing Special   »   [go: up one dir, main page]

skip to main content
Skip Table Of Content Section
article
Free
Fishspear: a priority queue algorithm

The Fishspear priority queue algorithm is presented and analyzed. Fishspear is comparable to the usual heap algorithm in its worst-case running time, and its relative performance is much better in many common situations. Fishspear also differs from the ...

article
Free
article
Free
Cryptographic limitations on learning Boolean formulae and finite automata

In this paper, we prove the intractability of learning several classes of Boolean functions in the distribution-free model (also called the Probably Approximately Correct or PAC model) of learning from examples. These results are representation ...

article
Free
Instance complexity
article
Free
Approximation algorithms for NP-complete problems on planar graphs
article
Free
A really temporal logic

We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the freeze quantifier binds a variable to the time of the local temporal context.

TPTL is both a natural ...

Subjects

Comments

Please enable JavaScript to view thecomments powered by Disqus.