2542 search results - page 79 / 509 » Computing Cartograms with Optimal Complexity |
133
click to vote
IJCAI
2003
15 years 4 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
139
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
124
click to vote
ECBS
2003
IEEE
15 years 8 months ago
2003
IEEE
Polymorphous computer-based systems are systems in which the CPU architecture “morphs” or changes shape to meet the requirements of the application. Optimized and efficient de...
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
116
Voted
WWW
2007
ACM
16 years 3 months ago
2007
ACM
The debate within the Web community over the optimal means by which to organize information often pits formalized classifications against distributed collaborative tagging systems...