5084 search results - page 266 / 1017 » Proving Possibility Properties |
157
click to vote
ISAAC
1999
Springer
15 years 11 months ago
1999
Springer
This paper considers recon gurations of polygons, where each polygon edge is a rigid link, no two of which can cross during the motion. We prove that one can recon gure any monoton...
156
Voted
FPCA
1989
15 years 10 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
175
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
170
click to vote
EUROCAST
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Pattern-based verification trying to abstract away the concrete number of repeated memory structures is one of the approaches that have recently been proposed for verific...
150
click to vote
CSB
2004
IEEE
15 years 10 months ago
2004
IEEE
In theory, it should be possible to infer realistic genetic networks from time series microarray data. In practice, however, network discovery has proved problematic. The three ma...