1700 search results - page 81 / 340 » Combinatorial Pattern Matching |
174
click to vote
WEA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
164
click to vote
ICCS
1998
Springer
15 years 9 months ago
1998
Springer
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics),...
126
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
148
Voted
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
127
click to vote
HEURISTICS
1998
15 years 4 months ago
1998
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...