3228 search results - page 319 / 646 » Computationally Sound Proofs |
169
click to vote
STACS
2004
Springer
16 years 24 days ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
207
click to vote
STACS
2009
Springer
15 years 12 months ago
2009
Springer
ABSTRACT. This paper gives a brief overview of computation models for data stream processing, and it introduces a new model for multi-pass processing of multiple streams, the so-ca...
204
click to vote
GI
2001
Springer
15 years 12 months ago
2001
Springer
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
174
click to vote
STACS
2001
Springer
15 years 12 months ago
2001
Springer
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
163
Voted
DIAGRAMS
2000
Springer
15 years 11 months ago
2000
Springer
This paper gives a brief overview of FG, a formal system for doing Euclidean geometry whose basic syntactic elements are geometric diagrams, and which has been implimentented as th...