16666 search results - page 290 / 3334 » Descriptive and Computational Complexity |
165
click to vote
ERSA
2007
15 years 8 months ago
2007
This paper describes a proof-of-concept implementation of a basic autonomous computing system. The system consists of an XUP Virtex-II Pro board running Linux and a set of softwar...
162
click to vote
JIFS
2002
15 years 6 months ago
2002
A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretatio...
174
click to vote
SWAP
2008
15 years 8 months ago
2008
Dynamic composition of web services requires an automated step of contracting, i.e., the computation of a possibly fruitful interaction between two (or more) services, based on the...
202
click to vote
DICTA
2003
15 years 8 months ago
2003
This paper describes a novel approach to the problem of recovering information from an image set by comparing the radiance of hypothesised point correspondences. This method is app...
150
click to vote
FLAIRS
2003
15 years 8 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...