Sciweavers

4930 search results - page 134 / 986
» Learning minimal abstractions
Sort
View
ICANN
2010
Springer
15 years 28 days ago
A Cooperative and Penalized Competitive Learning Approach to Gaussian Mixture Clustering
Abstract. Competitive learning approaches with penalization or cooperation mechanism have been applied to unsupervised data clustering due to their attractive ability of automatic ...
Yiu-ming Cheung, Hong Jia
ICMLA
2010
14 years 10 months ago
Incremental Learning of Relational Action Rules
Abstract--In the Relational Reinforcement learning framework, we propose an algorithm that learns an action model allowing to predict the resulting state of each action in any give...
Christophe Rodrigues, Pierre Gérard, C&eacu...
115
Voted
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 1 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
IJFCS
2006
130views more  IJFCS 2006»
15 years 22 days ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
120
Voted
ECTEL
2007
Springer
15 years 7 months ago
Scruffy Technologies to Enable (Work-integrated) Learning
Abstract. The goal of the APOSDLE (Advanced Process-Oriented SelfDirected Learning environment) project is to support work-integrated learning of knowledge workers. We argue that w...
Stefanie N. Lindstaedt, Peter Scheir, Armin Ulbric...