10608 search results - page 503 / 2122 » Complexity of O'Hara's Algorithm |
174
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
182
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
169
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
161
click to vote
FSTTCS
2009
Springer
16 years 18 days ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
154
click to vote
GECCO
2007
Springer
16 years 6 days ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...