Sciweavers

1893 search results - page 171 / 379
» Computational composites
Sort
View
COCO
1992
Springer
82views Algorithms» more  COCO 1992»
15 years 4 months ago
Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families
We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...
Stephen A. Bloch
86
Voted
CIA
2006
Springer
15 years 4 months ago
Selecting Web Services Statistically
Abstract. Service oriented computing oers a new approach to programming. To be useful for large and diverse sets of problems, eective service selection and composition is crucial. ...
David Lambert, David Robertson
120
Voted
ECAI
2010
Springer
15 years 1 months ago
Open-ended Grounded Semantics
Artificial agents trying to achieve communicative goals in situated interactions in the real-world need powerful computational systems for conceptualizing their environment. In ord...
Michael Spranger, Martin Loetzsch, Simon Pauw
104
Voted
LOGCOM
2007
126views more  LOGCOM 2007»
15 years 20 days ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones
108
Voted
ENTCS
2011
130views more  ENTCS 2011»
14 years 7 months ago
Bell States and Negative Sentences in the Distributed Model of Meaning
We use Bell states to provide compositional distributed meaning for negative sentences of English. The lexical meaning of each word of the sentence is a context vector obtained wi...
Anne Preller, Mehrnoosh Sadrzadeh