Sciweavers

10997 search results - page 323 / 2200
» On the Structure of Complete Sets
Sort
View
ESANN
2008
15 years 8 months ago
Using graph-theoretic measures to predict the performance of associative memory models
We test a selection of associative memory models built with different connection strategies, exploring the relationship between the structural properties of each network and its pa...
Lee Calcraft, Rod Adams, Weiliang Chen, Neil Davey
VSGAMES
2010
129views Game Theory» more  VSGAMES 2010»
15 years 5 months ago
Validation of Serious Games Attributes Using the Technology Acceptance Model
—The paper introduces a conceptual model for the design of serious games and uses the Technology Acceptance Model (TAM) for its validation. A specially developed game introduced ...
Amri Yusoff, Richard Crowder, Lester Gilbert
SIAMCOMP
2010
96views more  SIAMCOMP 2010»
15 years 1 months ago
Quantified Equality Constraints
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
Manuel Bodirsky, Hubie Chen
CORR
2004
Springer
100views Education» more  CORR 2004»
15 years 6 months ago
On the Theory of Structural Subtyping
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Viktor Kuncak, Martin C. Rinard
ECAI
2008
Springer
15 years 8 months ago
Approximate structure preserving semantic matching
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...