Sciweavers

654 search results - page 70 / 131
» Ordered Sets and Complete Lattices
Sort
View
JAPLL
2006
109views more  JAPLL 2006»
13 years 7 months ago
Deduction chains for common knowledge
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...
Mathis Kretz, Thomas Studer
TCS
1998
13 years 7 months ago
A Computational Model for Metric Spaces
In this paper we present an alternative order-theoretic proof of the Banach fixed point theorem for selfmaps on complete metric spaces which is based on formal balls and, contrary...
Abbas Edalat, Reinhold Heckmann
SCHOLARPEDIA
2008
109views more  SCHOLARPEDIA 2008»
13 years 7 months ago
Latent semantic analysis
A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higher-order structure in the association of terms with documents (&q...
Thomas K. Landauer, Susan T. Dumais
ENTCS
2010
118views more  ENTCS 2010»
13 years 5 months ago
Transaction Scripts: Making Implicit Scenarios Explicit
We describe a true-concurrent approach for managing dependencies between distributed and concurrent coordinator components of a long-running transaction. In previous work we have ...
Sotiris Moschoyiannis, Amir R. Razavi, Paul J. Kra...
ICMLA
2010
13 years 5 months ago
Incremental Learning of Relational Action Rules
Abstract--In the Relational Reinforcement learning framework, we propose an algorithm that learns an action model allowing to predict the resulting state of each action in any give...
Christophe Rodrigues, Pierre Gérard, C&eacu...