Sciweavers

1205 search results - page 20 / 241
» On P Systems with Bounded Parallelism
Sort
View
SASO
2007
IEEE
14 years 1 months ago
STORM: A Secure Overlay for P2P Reputation Management
A fundamental problem that confronts decentralized reputation systems is the design of efficient, secure and incentive-compatible mechanisms to gather trust information despite m...
Aina Ravoaja, Emmanuelle Anceaume
GRID
2006
Springer
13 years 7 months ago
YA: Fast and Scalable Discovery of Idle CPUs in a P2P network
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...
Javier Celaya, Unai Arronategui
FUIN
2002
88views more  FUIN 2002»
13 years 7 months ago
A Formalization of Transition P Systems
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...
Mario J. Pérez-Jiménez, Fernando San...
IPPS
2006
IEEE
14 years 1 months ago
Trust overlay networks for global reputation aggregation in P2P grid computing
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...
Runfang Zhou, Kai Hwang
DFG
1992
Springer
13 years 11 months ago
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques
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...
Miroslaw Kutylowski