Sciweavers

15421 search results - page 2800 / 3085
» Dependability
Sort
View
AISC
1998
Springer
15 years 11 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
15 years 11 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...
POPL
1998
ACM
15 years 11 months ago
Putting Pointer Analysis to Work
This paper addresses the problem of how to apply pointer analysis to a wide variety of compiler applications. We are not presenting a new pointer analysis. Rather, we focus on put...
Rakesh Ghiya, Laurie J. Hendren
CPE
1998
Springer
115views Hardware» more  CPE 1998»
15 years 11 months ago
On Choosing a Task Assignment Policy for a Distributed Server System
We consider a distributed server system model and ask which policy should be used for assigning tasks to hosts. In our model each host processes tasks in First-Come-First-Serve ord...
Mor Harchol-Balter, Mark Crovella, Cristina D. Mur...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 11 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
« Prev « First page 2800 / 3085 Last » Next »