5675 search results - page 153 / 1135 » Exploiting Chaos for Computation |
169
click to vote
ASP
2001
Springer
15 years 9 months ago
2001
Springer
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
113
click to vote
IPPS
1996
IEEE
15 years 8 months ago
1996
IEEE
The growing disparity between processor and memory speeds has caused memory bandwidth to become the performance bottleneck for many applications. In particular, this performance g...
120
click to vote
ECAI
1994
Springer
15 years 8 months ago
1994
Springer
This paper describes a computational model of similarity developed to support analogical software reuse. Similarity is computed from conceptual descriptions of software artifacts o...
153
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
155
click to vote
COORDINATION
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we investigate the relationship between two problems, related to distributed systems, that are of particular interest in the context of Service Oriented Computing: at...