Sciweavers

1399 search results - page 126 / 280
» Multi-party Finite Computations
Sort
View
ACMSE
2009
ACM
15 years 10 months ago
FI-based file access predictor
An algorithm is proposed for the purpose of optimizing the availability of files to an operating system prior to their being required during execution by a running system. This al...
Jinsuk Baek, Paul S. Fisher, Mingyung Kwak
IMR
2004
Springer
15 years 9 months ago
Twelve Ways to Fool The Masses when Describing Mesh Generation Performance
Mesh generation for finite element analysis is far from a solved problem. Although several automatic meshing algorithms exist, other difficulties of setting up a problem for finit...
Timothy J. Tautges, David R. White, Robert W. Lela...
DSN
2002
IEEE
15 years 9 months ago
Model Checking Safety Properties of Servo-Loop Control Systems
This paper presents the experiences of using a symbolic model checker to check the safety properties of a servoloop control system. Symbolic model checking has been shown to be be...
M. Edwin Johnson
142
Voted
CONCUR
2006
Springer
15 years 6 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
IJAC
2008
84views more  IJAC 2008»
15 years 4 months ago
Groups whose Geodesics are Locally Testable
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
Susan M. Hermiller, Derek F. Holt, Sarah Rees