Sciweavers

693 search results - page 58 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
AE
2003
Springer
15 years 9 months ago
Optimising Graph Partitions Using Parallel Evolution
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
Raul Baños, Consolación Gil, Julio O...
ACL
2009
15 years 1 months ago
Optimizing Word Alignment Combination For Phrase Table Training
Combining word alignments trained in two translation directions has mostly relied on heuristics that are not directly motivated by intended applications. We propose a novel method...
Yonggang Deng, Bowen Zhou
ICS
2007
Tsinghua U.
15 years 10 months ago
Scheduling FFT computation on SMP and multicore systems
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
152
Voted
CIBCB
2008
IEEE
15 years 10 months ago
Very large scale ReliefF for genome-wide association analysis
— The genetic causes of many monogenic diseases have already been discovered. However, most common diseases are actually the result of complex nonlinear interactions between mult...
Margaret J. Eppstein, Paul Haake
BMCBI
2010
135views more  BMCBI 2010»
15 years 4 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...