Sciweavers

3894 search results - page 396 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
142
Voted
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 10 months ago
MDGA: motif discovery using a genetic algorithm
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
Dongsheng Che, Yinglei Song, Khaled Rasheed
EC
2000
187views ECommerce» more  EC 2000»
15 years 4 months ago
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function i...
Eckart Zitzler, Kalyanmoy Deb, Lothar Thiele
DAM
2008
135views more  DAM 2008»
15 years 5 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
CIC
2004
118views Communications» more  CIC 2004»
15 years 6 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
ICASSP
2011
IEEE
14 years 8 months ago
Robust secondary multicast transmit beamforming for cognitive radio networks under imperfect channel state information
Consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive radio (CR) n...
Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...