23 search results - page 3 / 5 » Faster symmetry discovery using sparsity of symmetries |
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
Boolean matching is a powerful technique that has been used in technology mapping to overcome the limitations of structural pattern matching. The current basis for performing Bool...
TEC
2002
13 years 7 months ago
2002
Abstract--This paper considers the discovery of trading decision models from high-frequency foreign exchange (FX) markets data using genetic programming (GP). It presents a domain-...
CSCLP
2006
Springer
13 years 11 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
JSAT
2008
13 years 7 months ago
2008
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
EUROCRYPT
2004
Springer
14 years 28 days ago
2004
Springer
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...