506 search results - page 100 / 102 » Where Is the Value in a Program Verifier |
127
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
91
Voted
SODA
1997
ACM
15 years 1 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
116
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
Social laws have proved to be a powerful and theoretically elegant framework for coordination in multi-agent systems. Most existing models of social laws assume that a designer is...
120
Voted
CORR
2008
Springer
15 years 15 days ago
2008
Springer
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...
117
click to vote
ALGORITHMICA
2005
15 years 10 days ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...