155 search results - page 20 / 31 » A Comparison Between ACO Algorithms for the Set Covering Pro... |
WEA
2010
Springer
14 years 1 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
ALENEX
2009
13 years 7 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
BMCBI
2008
13 years 6 months ago
2008
Background: Structural alignment is an important step in protein comparison. Well-established methods exist for solving this problem under the assumption that the structures under...
SRDS
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
SODA
2003
ACM
13 years 8 months ago
2003
ACM
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...