Sciweavers

1167 search results - page 208 / 234
» Relational Markov Games
Sort
View
TCS
2008
13 years 9 months ago
Cleaning a network with brushes
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
Margaret-Ellen Messinger, Richard J. Nowakowski, P...
NN
1998
Springer
13 years 9 months ago
A tennis serve and upswing learning robot based on bi-directional theory
We experimented on task-level robot learning based on bi-directional theory. The via-point representation was used for ‘learning by watching’. In our previous work, we had a r...
Hiroyuki Miyamoto, Mitsuo Kawato
INFOCOM
2010
IEEE
13 years 8 months ago
INPAC: An Enforceable Incentive Scheme for Wireless Networks using Network Coding
—Wireless mesh networks have been widely deployed to provide broadband network access, and their performance can be significantly improved by using a new technology called netwo...
Tingting Chen, Sheng Zhong
PUC
2008
120views more  PUC 2008»
13 years 8 months ago
Technology scruples: why intimidation will not save the recording industry and how enchantment might
While the recording industry continues to lobby for increasingly draconian laws to protect their interests, users of digital technology continue to share files and copy protected ...
Mark Blythe, Peter C. Wright
MST
2010
78views more  MST 2010»
13 years 8 months ago
Sensitivity of Wardrop Equilibria
We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand fl...
Matthias Englert, Thomas Franke, Lars Olbrich