412 search results - page 48 / 83 » A New Proof of the F5 Algorithm |
114
click to vote
PLDI
2012
ACM
13 years 9 days ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
POPL
2010
ACM
15 years 7 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
ITRUST
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Question answering systems users may find answers without any supporting information insufficient for determining trust levels. Once those question answering systems beg...
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...
JCT
2008
14 years 9 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...