1562 search results - page 256 / 313 » Convenience Over Correctness |
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
107
click to vote
NIPS
2004
14 years 11 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
IJCAI
1993
14 years 11 months ago
1993
We introduce and use a new methodology for the study of logics for action and change. The methodology allows one to define a taxonomy of reasoning problems, based in particular on...
CSL
2010
Springer
14 years 11 months ago
2010
Springer
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res...
111
click to vote
TLDI
2010
ACM
14 years 10 months ago
2010
ACM
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...