968 search results - page 54 / 194 » A faster implementation of APlace |
133
click to vote
SOFSEM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
159
click to vote
WEA
2007
Springer
15 years 10 months ago
2007
Springer
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s a...
115
click to vote
WIA
2007
Springer
15 years 10 months ago
2007
Springer
We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Mini...
133
click to vote
CSL
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Focusing is traditionally seen as a means of reducing inessential nondeterminism in backward-reasoning strategies such as uniform proof-search or tableaux systems. In thi...
111
click to vote
ASIACRYPT
2004
Springer
15 years 9 months ago
2004
Springer
This paper proposes a new sieving algorithm that employs a bucket sort as a part of a factoring algorithm such as the number field sieve. The sieving step requires an enormous num...