Sciweavers

1763 search results - page 96 / 353
» A Formalization of Polytime Functions
Sort
View
ICCS
2004
Springer
15 years 3 months ago
A Cartesian Closed Category of Approximable Concept Structures
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...
Pascal Hitzler, Guo-Qiang Zhang
AIL
2007
96views more  AIL 2007»
14 years 10 months ago
Legal ontology of sales law application to ecommerce
Legal codes, such as the Uniform Commercial Code (UCC) examined in this article, are good points of entry for AI and ontology work because of their more straightforward adaptabili...
John W. Bagby, Tracy Mullen
JAR
2008
88views more  JAR 2008»
14 years 10 months ago
Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables
Statistical quantities, such as expectation (mean) and variance, play a vital role in the present age probabilistic analysis. In this paper, we present some formalization of expect...
Osman Hasan, Sofiène Tahar
FUIN
2008
107views more  FUIN 2008»
14 years 8 months ago
Nondeterminism in Constructive Z
The abstraction inherent in most specifications and the need to specify nondeterministic programs are two well-known sources of nondeterminism in formal specifications. In this pap...
Hassan Haghighi, Seyed-Hassan Mirian-Hosseinabadi

Publication
337views
16 years 1 months ago
Redistribution Mechanisms for Assignment of Heterogeneous Objects
There are p heterogeneous objects to be assigned to n competing agents (n > p) each with unit demand. It is required to design a Groves mechanism for this assignment problem ...
Sujit Gujar, Y Narahari