3378 search results - page 613 / 676 » A universe of binding and computation |
STOC
2010
ACM
15 years 2 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...
MPC
2010
Springer
15 years 2 months ago
2010
Springer
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
100
click to vote
TAMC
2009
Springer
15 years 2 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
CONCUR
2001
Springer
15 years 2 months ago
2001
Springer
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
ESOP
2001
Springer
15 years 2 months ago
2001
Springer
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...