Sciweavers

391 search results - page 10 / 79
» Formal Universes
Sort
View
CJ
2008
97views more  CJ 2008»
13 years 10 months ago
Three Kinds of Probabilistic Induction: Universal Distributions and Convergence Theorems
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated convergence theorems that show they tend to give good proba...
Ray J. Solomonoff
KDD
2010
ACM
195views Data Mining» more  KDD 2010»
14 years 1 months ago
Universal multi-dimensional scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...
IANDC
2008
81views more  IANDC 2008»
13 years 9 months ago
Universal extensions to simulate specifications
A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi and Lamport and proved the formalism to be semantically complete: every simulat...
Wim H. Hesselink
ASIAN
2006
Springer
91views Algorithms» more  ASIAN 2006»
14 years 1 months ago
A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations
Abstract. A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical fr...
Zhaohui Luo
ICRE
2000
IEEE
14 years 2 months ago
Requirements Documentation: Why a Formal Basis is Essential
Unless you have a complete and precise description of your product’s requirements, it is very unlikely that you will satisfy those requirements. A requirements document that is ...
David Lorge Parnas