1686 search results - page 64 / 338 » Programs as polygraphs: computability and complexity |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Supinterpretations have shown their interest to deal with...
HPCN
1998
Springer
15 years 1 months ago
1998
Springer
In this paper, we describe a graphical editor GRED as part of the integrated programming environment GRADE that is intended to support designing, debugging and performance tuning o...
AIEDAM
2008
14 years 10 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
Future high-end computers will offer great performance improvements over today’s machines, enabling applications of far greater complexity. However, designers must solve the cha...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...