8780 search results - page 16 / 1756 » On the Feasibility of Consistent Computations |
65
Voted
ENTCS
2002
14 years 9 months ago
2002
We show that the basic feasible functions of Cook and Urquhart's BFF [8,9] are precisely the functionals definable in a natural system of ramified recurrence that uses type i...
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper, we introduce a search engine, Dgoogle, designed for large scale P2P systems. Dgoogle is purely text-based, does not organize documents based on pre-defined keyw...
57
Voted
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Given two replication schemes old X and new X , the Replica Transfer Scheduling Problem (RTSP) aims at reaching new X , starting from old X , with minimal implementation cost. In ...
EUROPAR
2004
Springer
15 years 3 months ago
2004
Springer
Since embedded systems require ever more compute power, SMT processors are viable candidates for future high performance embedded processors. However, SMTs exhibit unpredictable pe...
AUSAI
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. Description logics are powerful knowledge representation systems providing well-founded and computationally tractable classification reasoning. However recognition of in...