135 search results - page 16 / 27 » Fixed-Point Definability and Polynomial Time |
FPL
2008
Springer
13 years 9 months ago
2008
Springer
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increa...
STACS
1998
Springer
13 years 11 months ago
1998
Springer
We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decis...
AAAI
2004
13 years 9 months ago
2004
Neural-symbolic systems are hybrid systems that integrate symbolic logic and neural networks. The goal of neural-symbolic integration is to benefit from the combination of feature...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
CJ
2006
13 years 7 months ago
2006
Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic prim...