231 search results - page 16 / 47 » A Brief Overview of PVS |
SIGACT
2010
13 years 5 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
LREC
2010
13 years 9 months ago
2010
The paper offers an overview of the key issues raised during the seven years' activity of the Multilingual Question Answering Track at the Cross Language Evaluation Forum (CL...
IJACDT
2011
12 years 11 months ago
2011
This study wishes to describe some of the key components of an art educational domain entitled ground<c>, which is being developed specifically for three dimensional online ...
ICIAP
2009
ACM
14 years 8 months ago
2009
ACM
In this paper we present an overview of the historical evolution of connected component labeling algorithms, and in particular the ones applied on images stored in raster scan orde...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...