Sciweavers

300 search results - page 53 / 60
» Extension of a theorem of Whitney
Sort
View
TSMC
2008
146views more  TSMC 2008»
13 years 8 months ago
Decentralized Learning in Markov Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is tha...
Peter Vrancx, Katja Verbeeck, Ann Nowé
CORR
2002
Springer
132views Education» more  CORR 2002»
13 years 8 months ago
Nonmonotonic Reasoning, Preferential Models and Cumulative Logics
Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always ...
Sarit Kraus, Daniel J. Lehmann, Menachem Magidor
CORR
2002
Springer
111views Education» more  CORR 2002»
13 years 8 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
DCG
2002
106views more  DCG 2002»
13 years 8 months ago
Perpendicular Dissections of Space
For each pair (Qi, Qj) of reference points and each real number r there is a unique hyperplane h QiQj such that d(P, Qi)2 - d(P, Qj)2 = r for points P in h. Take n reference point...
Thomas Zaslavsky
IANDC
2000
64views more  IANDC 2000»
13 years 8 months ago
Bisimilarity of Open Terms
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...
Arend Rensink