6978 search results - page 248 / 1396 » On Proofs in System P |
184
click to vote
JAR
2006
15 years 6 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
187
click to vote
TCS
2011
15 years 1 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
196
click to vote
FTDCS
2003
IEEE
15 years 12 months ago
2003
IEEE
The exponential data growth rate of the Internet makes it increasingly difficult for people to find desired information in a timely fashion. Information filtering and dissemina...
152
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—More and more processor manufacturers have launched embedded multicore processors for consumer electronics products because such processors provide high performance and low powe...
163
click to vote
PDPTA
2004
15 years 8 months ago
2004
As the algorithms that are used to reconstruct medical images from measurable projection data continue to become mature, medical image reconstruction has remained an interesting a...