2490 search results - page 289 / 498 » The Generalized Theory of Model Preference |
123
Voted
STOC
2001
ACM
16 years 4 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
161
Voted
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we consider how a BDI agent might determine its best course of action. We draw on previous work which has presented a model of persuasion over action and we discuss ...
132
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
A quality-time analysis of multi-objective evolutionary algorithms (MOEAs) based on schema theorem and building blocks hypothesis is developed. A bicriteria OneMax problem, a hypo...
130
click to vote
SC
2003
ACM
15 years 10 months ago
2003
ACM
We report on a model of the distribution of job submission interarrival times in supercomputers. Interarrival times are modeled as a consequence of a complicated set of decisions ...
124
click to vote
CONTEXT
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In a previous paper, we proposed a first formal and conceptual comparison between the two most important formalizations of context in AI: Propositional Logic of Context ...