10608 search results - page 530 / 2122 » Complexity of O'Hara's Algorithm |
143
click to vote
SAS
2001
Springer
15 years 10 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
150
click to vote
IJCAI
2007
15 years 7 months ago
2007
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
247
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
146
click to vote
WDAG
1995
Springer
15 years 9 months ago
1995
Springer
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
151
click to vote
ICCSA
2010
Springer
16 years 1 months ago
2010
Springer
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...