2490 search results - page 196 / 498 » Complexity of Contextual Reasoning |
128
click to vote
TCAD
2008
15 years 4 months ago
2008
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...
122
click to vote
CL
2004
Springer
15 years 4 months ago
2004
Springer
A new algorithm is introduced for analyzing possible nestings in mobile ambient calculus. It improves both time and space complexities of the technique proposed by Nielson and Sei...
178
click to vote
CL
2000
Springer
15 years 4 months ago
2000
Springer
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
139
click to vote
FMSD
2002
15 years 4 months ago
2002
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
135
click to vote
GIS
2010
ACM
15 years 3 months ago
2010
ACM
In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. We formally define different spatio-temporal criteria under ...