Sciweavers

725 search results - page 37 / 145
» Smoothed Analysis of Algorithms and Heuristics
Sort
View
ICCNMC
2005
Springer
15 years 3 months ago
Least Cost Multicast Spanning Tree Algorithm for Local Computer Network
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
Yong-Jin Lee, Mohammed Atiquzzaman
TCOS
2008
14 years 9 months ago
On Reduct Construction Algorithms
This paper critically analyzes reduct construction methods evels. At a high level, one can abstract commonalities from the existing algorithms, and classify them into three basic g...
Yiyu Yao, Yan Zhao, Jue Wang
AUSAI
2007
Springer
15 years 1 months ago
Branching Rules for Satisfiability Analysed with Factor Analysis
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
Richard J. Wallace, Stuart Bain
DAM
2008
81views more  DAM 2008»
14 years 10 months ago
Random-order bin packing
ct The average case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [?], Kenyon introduced the random-order ratio, a new average case...
Edward G. Coffman Jr., János Csirik, Lajos ...
IPPS
2008
IEEE
15 years 4 months ago
SWAMP: Smith-Waterman using associative massive parallelism
One of the most commonly used tools by computational biologists is some form of sequence alignment. Heuristic alignment algorithms developed for speed and their multiple results s...
Shannon Steinfadt, Johnnie W. Baker