Sciweavers

831 search results - page 21 / 167
» Coalgebraic Correspondence Theory
Sort
View
ASP
2001
Springer
13 years 11 months ago
Logic Programming Agents and Game Theory
In this paper we present a framework for logic programming agents to take part in games in such a way that stable models of the system, the ones agreed upon by all the members, co...
Marina De Vos, Dirk Vermeir
DLT
2003
13 years 8 months ago
Complexity Theory Made Easy
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
Heribert Vollmer
ESANN
1997
13 years 8 months ago
Neuronal theories and technical systems for face recognition
I present various systems for the recognition of human faces. They consist of three steps: feature extraction, solving the correspondence problem, and the actual comparison with st...
Rolf P. Würtz
SIAMDM
2010
149views more  SIAMDM 2010»
13 years 5 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
ALT
2008
Springer
14 years 3 months ago
Prequential Randomness
This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincid...
Vladimir Vovk, Alexander Shen