Sciweavers

6978 search results - page 335 / 1396
» On Proofs in System P
Sort
View
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 11 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
COCO
2010
Springer
129views Algorithms» more  COCO 2010»
15 years 10 months ago
On the Relative Strength of Pebbling and Resolution
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Jakob Nordström
IPPS
2006
IEEE
16 years 24 days ago
Simulating and optimizing a peer-to-peer computing framework
The aim of P2P computing is to build virtual computing systems dedicated to large-scale computational problems. JXTA1 proposes an underlying infrastructure on which JNGI2 , one of...
Jean-Baptiste Ernst-Desmulier, Julien Bourgeois, M...
MIDDLEWARE
2007
Springer
16 years 28 days ago
Peer-to-peer brokering of planning meta-data
In self-adaptive systems, metadata about resources in the system (e.g., services, nodes) must be dynamically published, updated, and removed. Current middleware approaches use sta...
Johannes Oudenstad, Frank Eliassen, Eli Gjø...
IPPS
2005
IEEE
16 years 11 days ago
A Mutual Anonymous Peer-to-Peer Protocol Design
Peer-to-Peer (P2P) computing has become a popular application model because of its easy resource sharing pattern and powerful query search scheme. However, decentralized P2P archi...
Jinsong Han, Yunhao Liu, Li Xiao, Renyi Xiao, Lion...