1686 search results - page 301 / 338 » Programs as polygraphs: computability and complexity |
SAC
2009
ACM
14 years 5 months ago
2009
ACM
Many general-purpose, object-oriented scripting languages are dynamically typed, to keep the language flexible and not reject any programs unnecessarily. However, dynamic typing ...
ISEUD
2009
Springer
14 years 5 months ago
2009
Springer
All software today is written using libraries, toolkits, frameworks and other application programming interfaces (APIs). We performed a user study of the online documentation a lar...
AMAI
2004
Springer
14 years 4 months ago
2004
Springer
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
ISAAC
2004
Springer
14 years 4 months ago
2004
Springer
RNA molecules whose secondary structures contain similar substructures often have similar functions. Therefore, an important task in the study of RNA is to develop methods for disc...
STOC
2010
ACM
14 years 3 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...