Sciweavers

6978 search results - page 231 / 1396
» On Proofs in System P
Sort
View
CADE
2005
Springer
16 years 7 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison
ICTAC
2004
Springer
15 years 12 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
ICPADS
2006
IEEE
16 years 19 days ago
XYZ: A Scalable, Partially Centralized Lookup Service for Large-Scale Peer-to-Peer Systems
Peer-to-Peer (P2P) systems are characterized by direct access between peer computers, rather than through a centralized server. File sharing is the dominant P2P application on the...
Jianying Zhang, Jie Wu
P2P
2010
IEEE
187views Communications» more  P2P 2010»
15 years 5 months ago
Do BitTorrent-Like VoD Systems Scale under Flash-Crowds?
—The efficiency of BitTorrent for file sharing has inspired a number of BitTorrent-based P2P protocols for Videoon-Demand (VoD). It has been shown that these systems are scalab...
Lucia D'Acunto, Tamas Vinko, Johan A. Pouwelse
AML
2011
204views Mathematics» more  AML 2011»
15 years 1 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek