Sciweavers

2750 search results - page 21 / 550
» The complexity of learning SUBSEQ(A)
Sort
View
JKM
2008
110views more  JKM 2008»
13 years 7 months ago
Barrier impact on organizational learning within complex organizations
Purpose
Stephen McLaughlin, Robert A. Paton, Douglas K. Ma...
ICTAI
2005
IEEE
14 years 1 months ago
Hybrid Learning Neuro-Fuzzy Approach for Complex Modeling Using Asymmetric Fuzzy Sets
A hybrid learning neuro-fuzzy system with asymmetric fuzzy sets (HLNFS-A) is proposed in this paper. The learning methods of random optimization (RO) and least square estimation (...
Chunshien Li, Kuo-Hsiang Cheng, Jiann-Der Lee
AI
2004
Springer
14 years 25 days ago
Multi-attribute Decision Making in a Complex Multiagent Environment Using Reinforcement Learning with Selective Perception
Abstract. Choosing between multiple alternative tasks is a hard problem for agents evolving in an uncertain real-time multiagent environment. An example of such environment is the ...
Sébastien Paquet, Nicolas Bernier, Brahim C...
BMVC
2010
13 years 5 months ago
Label propagation in complex video sequences using semi-supervised learning
We propose a novel directed graphical model for label propagation in lengthy and complex video sequences. Given hand-labelled start and end frames of a video sequence, a variation...
Ignas Budvytis, Vijay Badrinarayanan, Roberto Cipo...
ECCC
2008
117views more  ECCC 2008»
13 years 7 months ago
The complexity of learning SUBSEQ(A)
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
Stephen A. Fenner, William I. Gasarch, Brian Posto...