911 search results - page 18 / 183 » Kolmogorov Complexity Cores |
110
click to vote
AI
2006
Springer
15 years 2 months ago
2006
Springer
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
CSR
2009
Springer
15 years 8 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
128
click to vote
TCS
2008
15 years 1 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
114
click to vote
MFCS
2010
Springer
15 years 10 days ago
2010
Springer
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
105
click to vote
SIGECOM
2003
ACM
15 years 7 months ago
2003
ACM
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...