2446 search results - page 308 / 490 » Choiceless Polynomial Time |
COLING
2000
13 years 9 months ago
2000
Most of the studies in the framework of Lambek calculus have considered the parsing process and ignored the generation process. This paper wants to rely on the close link between ...
ISMB
1997
13 years 9 months ago
1997
Seq7 is a newprogramfor generating multiple structure-based alignments of RNAsequences. Byusing a variant of Dijkstra’s algorithm to find the shortest path through a specially c...
CSL
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
FSTTCS
2008
Springer
13 years 9 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
ICGI
2010
Springer
13 years 9 months ago
2010
Springer
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...