Sciweavers

1322 search results - page 92 / 265
» Unsound Theorem Proving
Sort
View
RSA
2010
64views more  RSA 2010»
13 years 6 months ago
Vertices of given degree in series-parallel graphs
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...
Michael Drmota, Omer Giménez, Marc Noy
RSA
2010
89views more  RSA 2010»
13 years 6 months ago
Ramsey properties of random discrete structures
We study thresholds for Ramsey properties of random discrete structures. In particular, we determine the threshold for Rado’s theorem for solutions of partition regular systems o...
Ehud Friedgut, Vojtech Rödl, Mathias Schacht
AML
2011
322views Mathematics» more  AML 2011»
13 years 2 months ago
A dedekind finite borel set
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B ⊆ 2ω is a Gδσ-set then either...
Arnold W. Miller
EUC
2005
Springer
14 years 1 months ago
Dependable Polygon-Processing Algorithms for Safety-Critical Embedded Systems
Algorithms that process geometric objects become more and more important for many safety-critical embedded systems, e.g. for motion planning or collision detection, where correctne...
Jens Brandt, Klaus Schneider
GCC
2003
Springer
14 years 28 days ago
Toward the Composition of Semantic Web Services
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
Jinghai Rao, Xiaomeng Su