1242 search results - page 128 / 249 » A Computational Complexity Theory in Membrane Computing |
166
click to vote
IJCAI
1989
15 years 7 months ago
1989
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
203
Voted
WWW
2011
ACM
15 years 1 months ago
2011
ACM
The psycholinguistic theory of communication accommodation accounts for the general observation that participants in conversations tend to converge to one another’s communicativ...
201
Voted
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
163
Voted
SIGECOM
2006
ACM
16 years 3 days ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
148
Voted
SMA
2009
ACM
16 years 20 days ago
2009
ACM
Over the last fifty years, there have been numerous efforts to develop from first principles a comprehensive discrete formulation of geometric physics, including Whitney’s ge...