661 search results - page 102 / 133 » What Can We Expect from Program Verification |
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
ICALP
2004
Springer
14 years 28 days ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
CRITICAL
2005
13 years 9 months ago
2005
During the last few years, there have been debates over what is context and how computers should act upon it. Two disparate camps of thought can be recognized. First, Realism, hav...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Human languages evolve continuously, and a puzzling problem is how to reconcile the apparent robustness of most of the deep linguistic structures we use with the evidence that the...
VLDB
2002
ACM
14 years 7 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...