Sciweavers

400 search results - page 46 / 80
» Extended formulations in combinatorial optimization
Sort
View
TCBB
2011
13 years 5 months ago
Accurate Construction of Consensus Genetic Maps via Integer Linear Programming
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
Yonghui Wu, Timothy J. Close, Stefano Lonardi
CEC
2011
IEEE
12 years 10 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
INFOCOM
2003
IEEE
14 years 4 months ago
Design of Light-Tree Based Logical Topologies for Multicast Streams in Wavelength Routed Optical Networks
—In this paper, we formulate an optimization problem for the design of light-tree based logical topology in Wavelength Division Multiplexing (WDM) networks. The problem is compri...
Wanjiun Liao
JSAC
2006
104views more  JSAC 2006»
13 years 10 months ago
Queue Proportional Scheduling via Geometric Programming in Fading Broadcast Channels
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is presented via geometric programming (GP). QPS finds a data ...
Kibeom Seong, Ravi Narasimhan, John M. Cioffi
WABI
2010
Springer
178views Bioinformatics» more  WABI 2010»
13 years 9 months ago
Haplotype Inference on Pedigrees with Recombinations and Mutations
Abstract. Haplotype Inference (HI) is a computational challenge of crucial importance in a range of genetic studies, such as functional genomics, pharmacogenetics and population ge...
Yuri Pirola, Paola Bonizzoni, Tao Jiang