Sciweavers

2479 search results - page 102 / 496
» A Computational Theory of Working Memory
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Graph-based methods for the analysis of large-scale multiagent systems
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
Wilbur Peng, William Krueger, Alexander Grushin, P...
COMPGEOM
2011
ACM
12 years 11 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
DBSEC
2009
163views Database» more  DBSEC 2009»
13 years 8 months ago
A Trust-Based Access Control Model for Pervasive Computing Applications
With the rapid growth in wireless networks and sensor and mobile devices, we are moving towards an era of pervasive computing. Access control is challenging in these environments. ...
Manachai Toahchoodee, Ramadan Abdunabi, Indrakshi ...
AIED
2005
Springer
14 years 1 months ago
Computer Games as Intelligent Learning Environments: A River Ecosystem Adventure
Our goal in this work has been to bring together the entertaining and flow characteristics of video game environments with proven learning theories to advance the state of the art ...
Jason Tan, Chris Beers, Ruchi Gupta, Gautam Biswas
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
14 years 8 days ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster