Sciweavers

14054 search results - page 208 / 2811
» P
Sort
View
IPPS
2000
IEEE
15 years 9 months ago
Fast Measurement of LogP Parameters for Message Passing Platforms
Abstract. Performance modeling is important for implementing efficient parallel applications and runtime systems. The LogP model captures the relevant aspects of message passing i...
Thilo Kielmann, Henri E. Bal, Kees Verstoep
DBA
2004
77views Database» more  DBA 2004»
15 years 6 months ago
Towards the Architecture of P2P-based Information Retrieval
In the conventional Peer-to-Peer (P2P) networks, many research projects or practical applications still use the keyword-based retrieval methods in the information searching compon...
Hao Ding, Peep Küngas, Yun Lin
FUIN
2002
80views more  FUIN 2002»
15 years 4 months ago
P Systems with Replicated Rewriting and Stream X-Machines (Eilenberg Machines)
Abstract. The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-machines (also called Eilenberg machines). In the first approach, the par...
Joaquin Aguado, Tudor Balanescu, Anthony J. Cowlin...
DCG
2008
101views more  DCG 2008»
15 years 4 months ago
On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes
For polytopes P1, P2 Rd we consider the intersection P1 P2, the convex hull of the union CH(P1 P2), and the Minkowski sum P1 + P2. For Minkowski sum we prove that enumerating t...
Hans Raj Tiwary
MEMBRANE
2005
Springer
15 years 10 months ago
P Systems, Petri Nets, and Program Machines
Some features capturing the computational completeness of P systems with maximal parallelism, priorities or zero-test using symbol objects are studied through Petri nets. The obtai...
Pierluigi Frisco