8699 search results - page 1571 / 1740 » Elements of the Theory of Computation |
CF
2005
ACM
15 years 1 months ago
2005
ACM
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
100
click to vote
ATAL
2010
Springer
15 years 18 days ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
CONEXT
2009
ACM
15 years 17 days ago
2009
ACM
The behavior of routing protocols during convergence is critical as it impacts end-to-end performance. Network convergence is particularly important in BGP, the current interdomai...
CPHYSICS
2008
14 years 11 months ago
2008
We present wannier90, a program for calculating maximally-localised Wannier functions (MLWF) from a set of Bloch energy bands that may or may not be attached to or mixed with othe...
ECCC
2006
14 years 11 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...