1095 search results - page 178 / 219 » Preprocessing of Intractable Problems |
CSR
2007
Springer
14 years 5 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
In a previous work we have proposed a hybrid Particle Swarm Optimisation/Ant Colony Optimisation (PSO/ACO) algorithm for the discovery of classification rules, in the context of d...
ISAAC
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
SAT
2007
Springer
14 years 4 months ago
2007
Springer
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...
IPPS
2006
IEEE
14 years 4 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...