Sciweavers

1158 search results - page 142 / 232
» Approximation Algorithms for the Fixed-Topology Phylogenetic...
Sort
View
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
15 years 9 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
JSAC
2006
79views more  JSAC 2006»
15 years 6 months ago
Layered Multicast Rate Control Based on Lagrangian Relaxation and Dynamic Programming
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...
Koushik Kar, Leandros Tassiulas
CORR
2007
Springer
97views Education» more  CORR 2007»
15 years 6 months ago
Longest Common Separable Pattern between Permutations
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
Mathilde Bouvel, Dominique Rossin, Stéphane...
EOR
2002
125views more  EOR 2002»
15 years 6 months ago
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Andrzej Jaszkiewicz
ICCAD
2009
IEEE
161views Hardware» more  ICCAD 2009»
15 years 3 months ago
The epsilon-approximation to discrete VT assignment for leakage power minimization
As VLSI technology reaches 45nm technology node, leakage power optimization has become a major design challenge. Threshold voltage (vt) assignment has been extensively studied, du...
Yujia Feng, Shiyan Hu