3424 search results - page 485 / 685 » Automated Testing of Classes |
130
click to vote
CSL
2005
Springer
15 years 10 months ago
2005
Springer
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...
138
click to vote
CSL
2005
Springer
15 years 10 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
127
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Mobile ad hoc networks are typically designed and evaluated in generic simulation environments. However the real conditions in which these networks are deployed can be quite diff...
104
click to vote
LACL
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2,3] and r...
120
click to vote
TARK
2005
Springer
15 years 10 months ago
2005
Springer
Fagin, Halpern, Moses, and Vardi have proposed a framework of epistemic agents with multiple “frames of mind” (local-reasoning structures), to solve problems concerning incons...