Sciweavers

968 search results - page 7 / 194
» A faster implementation of APlace
Sort
View
AGP
2003
IEEE
14 years 20 days ago
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
Gerald Pfeifer
ANTS
2008
Springer
93views Algorithms» more  ANTS 2008»
13 years 9 months ago
Faster Multiplication in GF(2)[x]
Abstract. In this paper, we discuss an implementation of various algorithms for multiplying polynomials in GF(2)[x]: variants of the window methods, Karatsuba's, Toom-Cook...
Richard P. Brent, Pierrick Gaudry, Emmanuel Thom&e...
SPIRE
2005
Springer
14 years 25 days ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
ICFP
2007
ACM
14 years 7 months ago
Faster laziness using dynamic pointer tagging
In the light of evidence that Haskell programs compiled by GHC exhibit large numbers of mispredicted branches on modern processors, we re-examine the "tagless" aspect of...
Simon Marlow, Alexey Rodriguez Yakushev, Simon L. ...
P2P
2008
IEEE
14 years 1 months ago
Faster Content Access in KAD
Many different Distributed Hash Tables (DHTs) have been designed, but only few have been successfully deployed. The implementation of a DHT needs to deal with practical aspects (e...
Moritz Steiner, Damiano Carra, Ernst W. Biersack