10392 search results - page 1911 / 2079 » Introduction to Computer Science |
127
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
123
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
117
Voted
HPDC
2010
IEEE
15 years 1 months ago
2010
IEEE
The explosion of data in the biological community demands the development of more scalable and flexible portals for bioinformatic computation. To address this need, we put forth c...
110
click to vote
MOBICOM
2010
ACM
15 years 27 days ago
2010
ACM
Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Althou...
114
click to vote
WISEC
2010
ACM
15 years 27 days ago
2010
ACM
Data breaches due to stolen laptops are a major problem. Solutions exist to secure sensitive files on laptops, but are rarely deployed because users view them as inconvenient. Thi...