1205 search results - page 20 / 241 » On P Systems with Bounded Parallelism |
122
Voted
SASO
2007
IEEE
15 years 6 months ago
2007
IEEE
A fundamental problem that confronts decentralized reputation systems is the design of efficient, secure and incentive-compatible mechanisms to gather trust information despite m...
114
Voted
GRID
2006
Springer
14 years 11 months ago
2006
Springer
Discovery of large amounts of idle CPUs in fully distributed and shared Grid systems is needed in relevant applications and is still a challenging problem. In this paper we present...
FUIN
2002
14 years 11 months ago
2002
Abstract. In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: trans...
106
click to vote
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
1 This paper presents a new approach to trusted Grid computing in a Peer-to-Peer (P2P) setting. Trust and security are essential to establish lasting working relationships among th...
131
click to vote
DFG
1992
Springer
15 years 3 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...