4435 search results - page 246 / 887 » Algorithms, games, and the internet |
207
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
In the paper, we present an approach to mining a directed social network from a message board on the Internet where vertices denote individuals and directed links denote the flow ...
208
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
In countries such as China or Iran where Internet censorship is prevalent, users usually rely on proxies or anonymizers to freely access the web. The obvious difficulty with this a...
203
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
156
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We address the problem of learning in repeated N-player (as opposed to 2-player) general-sum games. We describe an extension to existing criteria focusing explicitly on such setti...
155
click to vote
VRML
1997
ACM
15 years 11 months ago
1997
ACM
Level of detail generation is important for managing geometric complexity of three-dimensional objects and virtual worlds. However, most algorithms that compute levels of detail do...