The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
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...
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism de...
In this paper, we develop techniques based on evolvability statistics of the fitness landscape surrounding sampled solutions. Averaging the measures over a sample of equal fitness...
Tom Smith, Phil Husbands, Paul J. Layzell, Michael...
This paper presents an algorithm for incorporating a priori knowledge into data-driven identification of dynamic fuzzy models of the Takagi-Sugeno type. Knowledge about the modell...