8540 search results - page 1287 / 1708 » The Dynamic Servers Problem |
171
click to vote
KR
2010
Springer
15 years 10 months ago
2010
Springer
This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know...
159
click to vote
GIS
2009
ACM
15 years 9 months ago
2009
ACM
This paper proposes a method for generating a Focus+Glue +Context map for Web map services by improving existing fisheye views methods for cartographic data. While many studies h...
133
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
177
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
157
click to vote
AAAI
2008
15 years 7 months ago
2008
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...