Sciweavers

1055 search results - page 95 / 211
» Enumerations in computable structure theory
Sort
View
SEMWEB
2009
Springer
15 years 11 months ago
Axiomatic First-Order Probability
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
Kathryn B. Laskey
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 8 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
TCS
2002
15 years 4 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
GROUP
2003
ACM
15 years 9 months ago
Communities of action: a cognitive and social approach to the design of CSCW systems
Most current theories about collective cognitive activities in limited groups apply to structurally closed co-operative situations Here we propose to work in the framework of inte...
Manuel Zacklad
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 4 months ago
Mathematical Foundations for a Compositional Distributional Model of Meaning
We propose a mathematical framework for a unification of the distributional theory of meaning in terms of vector space models, and a compositional theory for grammatical types, fo...
Bob Coecke, Mehrnoosh Sadrzadeh, Stephen Clark