Sciweavers

1712 search results - page 290 / 343
» A Computational Approach to Binding Theory
Sort
View
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 1 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
CORR
2008
Springer
84views Education» more  CORR 2008»
15 years 1 months ago
The Latent Relation Mapping Engine: Algorithm and Experiments
Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure ...
Peter D. Turney
ENTCS
2008
120views more  ENTCS 2008»
15 years 1 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
HEURISTICS
2006
102views more  HEURISTICS 2006»
15 years 1 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson
IJON
2006
103views more  IJON 2006»
15 years 1 months ago
Evolutionary system for automatically constructing and adapting radial basis function networks
This article presents a new system for automatically constructing and training radial basis function networks based on original evolutionary computing methods. This system, called...
Daniel Manrique, Juan Rios, Alfonso Rodrígu...