Sciweavers

2523 search results - page 279 / 505
» Objective: In Minimum Context
Sort
View
APPROX
2005
Springer
150views Algorithms» more  APPROX 2005»
16 years 4 days ago
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
Julián Mestre
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
16 years 1 days ago
Resource-constrained low-power bus encoding with crosstalk delay elimination
— In deep-submicron (DSM) technology, minimizing power consumption of a bus is one of the most important design objectives in embedded system-on-chip (SoC) design. In this paper,...
Meeyoung Cha, Chun-Gi Lyuh, Taewhan Kim
SAC
2004
ACM
16 years 19 hour ago
An improved hybrid genetic algorithm for the generalized assignment problem
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
Harald Feltl, Günther R. Raidl
DEXA
2004
Springer
115views Database» more  DEXA 2004»
15 years 12 months ago
TriM: Tri-Modal Data Communication in Mobile Ad-Hoc Networks
A Mobile Ad-Hoc Network (MANET) is a group of wireless, mobile, battery-powered clients and servers that autonomously form temporary networks. Three data communication modes can be...
Leslie D. Fife, Le Gruenwald
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
15 years 12 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel