612 search results - page 107 / 123 » Hardness assumptions in the foundations of theoretical compu... |
MABS
2004
Springer
14 years 1 months ago
2004
Springer
The emerging ”Computational Grid” infrastructure poses many new opportunities for the developing science of large scale multiagent simulation. The ability to migrate agent expe...
KI
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
CVIU
2011
12 years 11 months ago
2011
In this paper, we tackle the problem of embedding a set of relational structures into a metric space for purposes of matching and categorisation. To this end, we view the problem ...
IGPL
2008
13 years 7 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
DAC
2003
ACM
14 years 8 months ago
2003
ACM
This paper considers the role of performance and area estimates from behavioral synthesis in design space exploration. We have developed a compilation system that automatically ma...