1242 search results - page 128 / 249 » A Computational Complexity Theory in Membrane Computing |
IJCAI
1989
14 years 11 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...
100
click to vote
WWW
2011
ACM
14 years 4 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...
COMPGEOM
2011
ACM
14 years 1 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...
SIGECOM
2006
ACM
15 years 3 months 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...
SMA
2009
ACM
15 years 4 months 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...