Sciweavers

1205 search results - page 55 / 241
» On P Systems with Bounded Parallelism
Sort
View
COCO
1989
Springer
97views Algorithms» more  COCO 1989»
13 years 11 months ago
On the Structure of Bounded Queries to Arbitrary NP Sets
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
Richard Chang
IPPS
2007
IEEE
14 years 1 months ago
A Configuration Control Mechanism Based on Concurrency Level for a Reconfigurable Consistency Algorithm
A Reconfigurable Consistency Algorithm (RCA) is an algorithm that guarantees the consistency in Distributed Shared Memory (DSM) Systems. In a RCA, there is a Configuration Control...
Christiane V. Pousa, Luís Fabrício W...
ISPA
2004
Springer
14 years 1 months ago
A Peer-to-Peer Mechanism for Resource Location and Allocation Over the Grid
Abstract. Recent advances in P2P lookup overlays provide an appealing solution for distributed search without relying on a single database server. In addition to performing resourc...
Hung-Chang Hsiao, Mark Baker, Chung-Ta King
IPPS
2008
IEEE
14 years 2 months ago
Towards feasibility and scalability of text search in peer-to-peer systems
— 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...
A. Lal, V. Gupta, Khaled Harfoush, Injong Rhee
ICDCS
1995
IEEE
13 years 11 months ago
Analysis of Resource Lower Bounds in Real-Time Applications
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...
Raed Alqadi, Parameswaran Ramanathan