Sciweavers

5214 search results - page 48 / 1043
» The Online Specialization Problem
Sort
View
AAAI
1993
13 years 9 months ago
Complexity Analysis of Real-Time Reinforcement Learning
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
Sven Koenig, Reid G. Simmons
ICTA
2009
IEEE
14 years 2 months ago
Feasibility Analysis for SemiAutomatic Conversion of Text to Improve Readability
1 WCAG 2.0 (W3C Recommendation 11 Dec. 2008) recommendation includes a specific guideline regarding the readability of text contents. This paper presents an approach to adapt text ...
Susana Bautista, Pablo Gervás, R. Ignacio M...
IWANN
2005
Springer
14 years 1 months ago
CMOL CrossNets as Pattern Classifiers
This presentation has two goals: (i) to review the recently suggested concept of bio-inspired CrossNet architectures for future hybrid CMOL VLSI circuits and (ii) to present new re...
Jung Hoon Lee, Konstantin Likharev
STACS
1999
Springer
13 years 12 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
COR
2010
129views more  COR 2010»
13 years 6 months ago
Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work i...
Mohamed Ali Aloulou, Christian Artigues