Sciweavers

1668 search results - page 280 / 334
» Two Philosophical Applications of Algorithmic Information Th...
Sort
View
ATAL
2008
Springer
13 years 10 months ago
Exploiting locality of interaction in factored Dec-POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute an expressive framework for multiagent planning under uncertainty, but solving them is provabl...
Frans A. Oliehoek, Matthijs T. J. Spaan, Shimon Wh...
CF
2005
ACM
13 years 10 months ago
Grid result checking
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
Cécile Germain-Renaud, Dephine Monnier-Raga...
ICALP
2011
Springer
12 years 11 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
MMS
2008
13 years 7 months ago
Mobile cinema: canonical processes for video adaptation
Nowadays, users not only want to watch digital videos on a PC but also use mobile devices to play back multimedia content. Video adaptation algorithms enable the visualization of ...
Stephan Kopf, Wolfgang Effelsberg
INFOCOM
2007
IEEE
14 years 2 months ago
Separability and Topology Control of Quasi Unit Disk Graphs
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, F...