3218 search results - page 15 / 644 » Timed Extensions for SDL |
COR
2006
13 years 8 months ago
2006
This paper is concerned with extending models for the maximal covering location problem in two ways. First, the usual 0
TIME
2005
IEEE
14 years 2 months ago
2005
IEEE
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+ . In the application of the resolution rules...
ISSAC
1997
Springer
14 years 26 days ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
CP
2006
Springer
14 years 13 days ago
2006
Springer
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
JOC
2006
13 years 8 months ago
2006
We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for ...