11345 search results - page 1881 / 2269 » Foundations of Computer Science |
140
click to vote
FCT
2009
Springer
15 years 11 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
132
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...
135
click to vote
GROUP
2009
ACM
15 years 11 months ago
2009
ACM
Previous research has explored how technology can motivate healthy living in social groups such as friends and coworkers. However, little research has focused on the implications ...
119
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
109
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...