3136 search results - page 368 / 628 » Comparison of Clique-Listing Algorithms |
163
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
170
click to vote
ICISC
2004
15 years 8 months ago
2004
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
173
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
Following the pioneer work of Yokoo and colleagues on the ABT (asynchronous backtracking) algorithm, several ABT-based procedures have been proposed for solving distributed constr...
161
click to vote
INFSOF
2007
15 years 6 months ago
2007
Software clustering algorithms presented in the literature rarely incorporate in the clustering process dynamic information, such as the number of function invocations during runt...
164
click to vote
TIP
2008
15 years 6 months ago
2008
We provide a detailed analysis of the use of minimal spanning graphs as an alignment method for registering multimodal images. This yields an efficient graph theoretic algorithm th...