Sciweavers

599 search results - page 41 / 120
» The repeater tree construction problem
Sort
View
COMCOM
2006
100views more  COMCOM 2006»
14 years 9 months ago
Routing and wavelength assignment for core-based tree in WDM networks
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
Jianping Wang, Xiangtong Qi, Mei Yang
JCSS
2002
95views more  JCSS 2002»
14 years 9 months ago
Efficient algorithms for multichromosomal genome rearrangements
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
Glenn Tesler
BIBE
2006
IEEE
135views Bioinformatics» more  BIBE 2006»
15 years 3 months ago
Evidence of Multiple Maximum Likelihood Points for a Phylogenetic Tree
An interesting and important, but largely ignored question associated with the ML method is whether there exists only a single maximum likelihood point for a given phylogenetic tr...
Bing Bing Zhou, Monther Tarawneh, Pinghao Wang, Da...
IPPS
1999
IEEE
15 years 2 months ago
Parallel Out-of-Core Divide-and-Conquer Techniques with Application to Classification Trees
Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. D...
Mahesh K. Sreenivas, Khaled Alsabti, Sanjay Ranka
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
14 years 10 months ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens