Sciweavers

4403 search results - page 585 / 881
» Galois Theory of Algorithms
Sort
View
NIL
1991
15 years 11 months ago
Deduction with Supernormal Defaults
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
Stefan Brass
216
Voted
GECCO
2010
Springer
153views Optimization» more  GECCO 2010»
15 years 10 months ago
Multi-task evolutionary shaping without pre-specified representations
Shaping functions can be used in multi-task reinforcement learning (RL) to incorporate knowledge from previously experienced tasks to speed up learning on a new task. So far, rese...
Matthijs Snel, Shimon Whiteson
206
Voted
CAE
2007
15 years 10 months ago
Conceptualizing Birkhoff's Aesthetic Measure Using Shannon Entropy and Kolmogorov Complexity
In 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff's measure from an i...
Jaume Rigau, Miquel Feixas, Mateu Sbert
181
Voted
VISSYM
2007
15 years 10 months ago
Grouse: Feature-Based, Steerable Graph Hierarchy Exploration
Grouse is a feature-based approach to steerable exploration of a graph and an associated hierarchy. Steerability allows exploration to begin immediately, rather than requiring a c...
Daniel Archambault, Tamara Munzner, David Auber
216
Voted
ATAL
2008
Springer
15 years 9 months ago
Continual collaborative planning for mixed-initiative action and interaction
Multiagent environments are often highly dynamic and only partially observable which makes deliberative action planning computationally hard. In many such environments, however, a...
Michael Brenner