14774 search results - page 225 / 2955 » Computational complexity and evolutionary computation |
150
Voted
CIE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
148
click to vote
TROB
2002
2002
DPAC: an object-oriented distributed and parallel computing framework for manufacturing applications
15 years 4 months ago
Parallel and distributed computing infrastructure are increasingly being embraced in the context of manufacturing applications, including real-time scheduling. In this paper, we pr...
189
click to vote
LOGCOM
2010
14 years 11 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
137
click to vote
IACR
2011
14 years 4 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
121
click to vote
PVLDB
2008
15 years 4 months ago
2008
The measure of similarity between objects is a very useful tool in many areas of computer science, including information retrieval. SimRank is a simple and intuitive measure of th...