Sciweavers

6978 search results - page 288 / 1396
» On Proofs in System P
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Do humans identify efficient strategies in structured peer-to-peer systems?
In the last years, distributed coordinator-free systems, e.g., peerto-peer systems (P2P systems), have attracted much interest among researchers and practitioners. In these system...
Stephan Schosser, Klemens Böhm, Bodo Vogt
COCO
2003
Springer
135views Algorithms» more  COCO 2003»
15 years 12 months ago
Disjoint NP-Pairs
We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof system...
Christian Glaßer, Alan L. Selman, Samik Seng...
DAGSTUHL
2006
15 years 8 months ago
New tricks from an old dog: An overview of TEI P5
This paper presents an update on the current state of development of the Text Encoding Initiative's Guidelines for Electronic Text Encoding and Interchange. Since the last ma...
Lou Burnard
ICDE
2006
IEEE
131views Database» more  ICDE 2006»
16 years 23 days ago
A Peer-to-Peer Architecture to Enable Versatile Lookup System Design
The resource lookup requirements in applications such as web caching, web content search, content distribution, resource sharing, network monitoring and management, and e-commerce...
Vivek Sawant, Jasleen Kaur
SLOGICA
2002
98views more  SLOGICA 2002»
15 years 6 months ago
A Cut-Free Sequent System for the Smallest Interpretability Logic
In [Sas01], it was given a cut-free sequent system for the smallest interpretability logic IL. He first gave a cut-free system for IK4, a sublogic of IL, whose -free fragment is th...
Katsumi Sasaki