7988 search results - page 384 / 1598 » A Useful Undecidable Theory |
204
click to vote
AGI
2011
14 years 10 months ago
2011
We represent agents as sets of strings. Each string encodes a potential interaction with another agent or environment. We represent the total set of dynamics between two agents as ...
195
click to vote
TVCG
2012
13 years 9 months ago
2012
—The broad goals of verifiable visualization rely on correct algorithmic implementations. We extend a framework for verification of isosurfacing implementations to check topologi...
179
click to vote
SIGCOMM
2005
ACM
16 years 10 days ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
204
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
222
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
The field of multiagent decision making is extending its tools from classical game theory by embracing reinforcement learning, statistical analysis, and opponent modeling. For ex...