1712 search results - page 201 / 343 » A Computational Approach to Binding Theory |
112
click to vote
STOC
1993
ACM
15 years 6 months ago
1993
ACM
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
137
click to vote
AAAI
2000
15 years 3 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
120
click to vote
TPHOL
2007
IEEE
15 years 8 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
138
click to vote
SAC
2010
ACM
15 years 8 months ago
2010
ACM
Extensive research activities are recently directed towards the Semantic Web as a future form of the Web. Consequently, Web search as the key technology of the Web is evolving tow...
124
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper we address the problem of selfish behavior in ad hoc networks. We propose a strategy driven approach which aims at enforcing cooperation between network participant...