3690 search results - page 370 / 738 » Computation with classical sequents |
151
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
173
click to vote
IJON
2006
15 years 6 months ago
2006
The immense computational and adaptive power of the cerebral cortex emerges from the collective dynamics of large populations of interacting neurons. Thus, for theoretical investi...
186
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
162
click to vote
IPL
2006
15 years 6 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
177
click to vote
JUCS
2006
15 years 6 months ago
2006
: Emerging interaction paradigms, such as service-oriented computing, and new technological challenges, such as exogenous component coordination, suggest new roles and application ...