5608 search results - page 152 / 1122 » On the Theory of Matchgate Computations |
117
click to vote
FOSSACS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
106
click to vote
ICAIL
2003
ACM
15 years 7 months ago
2003
ACM
Defeasible Logic is a promising representation for legal knowledge that appears to overcome many of the deficiencies of previous approaches to representing legal knowledge. Unfor...
93
Voted
COMPSAC
2009
IEEE
15 years 6 months ago
2009
IEEE
Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theor...
118
click to vote
WOWMOM
2009
ACM
15 years 6 months ago
2009
ACM
In this paper, we focus on proactive radio resource management schemes that retain the quality of the individual connections by pre-reserving the needed resources in a cellular ne...
119
click to vote
RSKT
2009
Springer
15 years 6 months ago
2009
Springer
In rough set theory, the problem of feature selection aims to retain the discriminatory power of original features. Many feature selection algorithms have been proposed, however, q...