Sciweavers

4355 search results - page 283 / 871
» Increasing Kolmogorov Complexity
Sort
View
ACG
2009
Springer
16 years 1 months ago
Data Assurance in Opaque Computations
The chess endgame is increasingly being seen through the lens of, and therefore effectively defined by, a data ‘model’ of itself. It is vital that such models are clearly faith...
Joe Hurd, Guy Haworth
CIKM
2009
Springer
16 years 1 months ago
Agglomerating local patterns hierarchically with ALPHA
To increase the relevancy of local patterns discovered from noisy relations, it makes sense to formalize error-tolerance. Our starting point is to address the limitations of state...
Loïc Cerf, Pierre-Nicolas Mougel, Jean-Fran&c...
ECMDAFA
2009
Springer
109views Hardware» more  ECMDAFA 2009»
16 years 1 months ago
Uniform Random Generation of Huge Metamodel Instances
The size and the number of models is drastically increasing, preventing organizations from fully exploiting Model Driven Engineering benefits. Regarding this problem of scalabilit...
Alix Mougenot, Alexis Darrasse, Xavier Blanc, Mich...
ESAW
2009
Springer
16 years 1 months ago
Programming Organization-Aware Agents
Organizational notions such as roles, norms (e.g., obligations and permissions), and services are increasingly viewed as natural concepts to manage the complexity of software devel...
M. Birna van Riemsdijk, Koen V. Hindriks, Catholij...
ICCBR
2009
Springer
16 years 1 months ago
S-Learning: A Model-Free, Case-Based Algorithm for Robot Learning and Control
A model-free, case-based learning and control algorithm called S-learning is described as implemented in a simulation of a light-seeking mobile robot. S-learning demonstrated learn...
Brandon Rohrer