346 search results - page 59 / 70 » Logical omniscience as a computational complexity problem |
IJCAI
1989
13 years 8 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...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
ICCSA
2009
Springer
14 years 2 months ago
2009
Springer
Data aggregation in Geographic Information Systems (GIS) is a desirable feature, spatial data are integrated in OLAP engines for this purpose. However, the development and operatio...
IEEEPACT
1999
IEEE
13 years 12 months ago
1999
IEEE
In current superscalar processors, all floating-point resources are idle during the execution of integer programs. As previous works show, this problem can be alleviated if the fl...
CHI
1998
ACM
13 years 11 months ago
1998
ACM
considered simply, but a more complex evaluation of the effects of performing the tasks. For example, an educational activity that learners complete quickly and accurately is of no...