Sciweavers

1115 search results - page 33 / 223
» An Abstract Look at Realizability
Sort
View
AISC
2008
Springer
13 years 9 months ago
Effective Set Membership in Computer Algebra and Beyond
Abstract. In previous work, we showed the importance of distinguishing "I know that X = Y " from "I don't know that X = Y ". In this paper we look at effec...
James H. Davenport
ICES
2007
Springer
88views Hardware» more  ICES 2007»
13 years 9 months ago
Evolving and Analysing "Useful" Redundant Logic
Abstract. Fault Tolerance is an increasing challenge for integrated circuits due to semiconductor technology scaling. This paper looks at how artificial evolution may be tuned to ...
Asbjørn Djupdal, Pauline C. Haddow
ECAI
2010
Springer
13 years 8 months ago
Detecting Ironic Intent in Creative Comparisons
Abstract. Irony is an effective but challenging mode of communication that allows a speaker to express sentiment-rich viewpoints with concision, sharpness and humour. Irony is espe...
Tony Veale, Yanfen Hao
TCC
2010
Springer
133views Cryptology» more  TCC 2010»
13 years 5 months ago
On the Necessary and Sufficient Assumptions for UC Computation
Abstract. We study the necessary and sufficient assumptions for universally composable (UC) computation, both in terms of setup and computational assumptions. We look at the common...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...
IJFCS
2011
78views more  IJFCS 2011»
13 years 2 months ago
P Systems and Topology: Some Suggestions for Research
some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to pology. In turn, the ...
Pierluigi Frisco, Hendrik Jan Hoogeboom