Sciweavers

293 search results - page 8 / 59
» Optimal Integer Alphabetic Trees in Linear Time
Sort
View
TCBB
2011
13 years 2 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
IPCO
2001
117views Optimization» more  IPCO 2001»
13 years 9 months ago
Pruning by Isomorphism in Branch-and-Cut
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
François Margot
ICRA
2009
IEEE
98views Robotics» more  ICRA 2009»
14 years 2 months ago
Multi-robot routing with linear decreasing rewards over time
Abstract— We study multi-robot routing problems (MRLDR) where a team of robots has to visit a set of given targets with linear decreasing rewards over time, such as required for ...
Ali Ekici, Pinar Keskinocak, Sven Koenig
JSAC
2007
86views more  JSAC 2007»
13 years 7 months ago
Asymptotically optimal cooperative wireless networks with reduced signaling complexity
Abstract— This paper considers an orthogonal amplify-andforward (OAF) protocol for cooperative relay communication over Rayleigh-fading channels in which the intermediate relays ...
Petros Elia, Frédérique E. Oggier, P...
MP
2011
13 years 2 months ago
An FPTAS for minimizing the product of two non-negative linear cost functions
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
Vineet Goyal, Latife Genç Kaya, R. Ravi