20294 search results - page 31 / 4059 » Algorithmic Information Theory |
114
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
102
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem...
206
click to vote
WWW
2008
ACM
16 years 4 months ago
2008
ACM
This paper introduces a novel method for composing Web services in the presence of external volatile information. Our approach, which we call the informed-presumptive, is compared...
140
click to vote
MFCS
2001
Springer
15 years 8 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
110
Voted
RECSYS
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...