10568 search results - page 181 / 2114 » Computer Intelligence and Formalization |
138
click to vote
ECAI
1992
Springer
15 years 7 months ago
1992
Springer
Abstract. The paper refutes the general phenomenological argument that knowledge cannot be completely represented by symbols and, hence, symbolic AI does not work. Moreover, the vi...
110
click to vote
PDP
2009
IEEE
15 years 9 months ago
2009
IEEE
PUB (Paderborn University BSPLib) is a C library supporting the development of Bulk-Synchronous Parallel (BSP) algorithms. The BSP model allows an estimation of the execution time...
124
click to vote
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper presents general techniques for formally modeling, simulating, and model checking real-time resource-sharing protocols in Real-Time Maude. The “scheduling subset” o...
116
click to vote
TGC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In this survey paper we consider the class of protocols for informationhiding which use randomization to obfuscate the link between the observables and the information to...
104
click to vote
FCT
2001
Springer
15 years 7 months ago
2001
Springer
This paper presents the prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages, in particular, simple CFGs and finite unions of regular ...