412 search results - page 47 / 83 » A New Proof of the F5 Algorithm |
105
click to vote
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
IJON
2008
14 years 9 months ago
2008
Virtual neurons are essential in computational neuroscience to study the relation between neuronal form and function. One way of obtaining virtual neurons is by algorithmic genera...
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
POPL
2012
ACM
13 years 5 months ago
2012
ACM
Software-defined networks (SDNs) are a new implementation architecture in which a controller machine manages a distributed collection of switches, by instructing them to install ...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...