1818 search results - page 117 / 364 » Granularity-Adaptive Proof Presentation |
FUIN
2006
13 years 10 months ago
2006
This paper proposes the use of session types to extend with behavioural information the simple descriptions usually provided by software component interfaces. We show how session t...
COMPUTING
2007
13 years 10 months ago
2007
We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For we...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
—The parameterless self-organizing map (PLSOM) is a new neural network algorithm based on the self-organizing map (SOM). It eliminates the need for a learning rate and annealing ...
JCSS
2006
13 years 10 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
ENDM
2007
13 years 10 months ago
2007
Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present ...