4372 search results - page 298 / 875 » Algorithmic Theories of Everything |
215
Voted
FOSSACS
2009
Springer
16 years 28 days ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
155
Voted
STOC
1993
ACM
15 years 10 months ago
1993
ACM
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
187
click to vote
ATAL
2008
Springer
15 years 8 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...
171
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
162
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...