Sciweavers

1419 search results - page 99 / 284
» Notes on Formalizing Context
Sort
View
COCO
2000
Springer
112views Algorithms» more  COCO 2000»
15 years 5 months ago
Combinatorial Interpretation of Kolmogorov Complexity
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
Andrei E. Romashchenko, Alexander Shen, Nikolai K....
89
Voted
KR
1989
Springer
15 years 4 months ago
Impediments to Universal Preference-Based Default Theories
Research on nonmonotonic and default reasoning has identified several important criteria for preferring alternative default inferences. The theories of reasoning based on each of...
Jon Doyle, Michael P. Wellman
88
Voted
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 4 months ago
Standard and averaging reinforcement learning in XCS
This paper investigates reinforcement learning (RL) in XCS. First, it formally shows that XCS implements a method of generalized RL based on linear approximators, in which the usu...
Pier Luca Lanzi, Daniele Loiacono
96
Voted
IEAAIE
2000
Springer
15 years 4 months ago
Fuzzy Modeling Approach for Integrated Assessments Using Cultural Theory
It has already been noted that the accurate prediction of societal responses requires the use of a formal model based on some social or cultural taxonomy. One such taxonomic candi...
Adnan Yazici, Frederick E. Petry, Curt Pendergraft
CONCUR
2008
Springer
15 years 2 months ago
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
In this paper, we present a unified approach to evaluating the relative expressive power of process calculi. In particular, we identify a small set of criteria (that have already b...
Daniele Gorla