Sciweavers

8699 search results - page 1499 / 1740
» Elements of the Theory of Computation
Sort
View
COGSCI
2010
85views more  COGSCI 2010»
15 years 6 months ago
The Effects of Feature-Label-Order and Their Implications for Symbolic Learning
Symbols enable people to organize and communicate about the world. However, the ways in which symbolic knowledge is learned and then represented in the mind are poorly understood....
Michael Ramscar, Daniel Yarlett, Melody Dye, Katie...
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 6 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 6 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
97views Education» more  CORR 2008»
15 years 6 months ago
Modeling Cultural Dynamics
EVOC (for EVOlution of Culture) is a computer model of culture that enables us to investigate how various factors such as barriers to cultural diffusion, the presence and choice o...
Liane Gabora
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 6 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
« Prev « First page 1499 / 1740 Last » Next »