Sciweavers

7006 search results - page 199 / 1402
» Approximation Algorithms
Sort
View
CEC
2009
IEEE
15 years 10 months ago
The Pareto-Following Variation Operator as an alternative approximation model
— This paper presents a critical analysis of the Pareto-Following Variation Operator (PFVO) when used as an approximation method for Multiobjective Evolutionary Algorithms (MOEA)...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
16 years 4 days ago
System-wide energy minimization for real-time tasks: lower bound and approximation
We present a dynamic voltage scaling (DVS) technique that minimizes system-wide energy consumption for both periodic and sporadic tasks. It is known that a system consists of proc...
Xiliang Zhong, Cheng-Zhong Xu
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
13 years 5 months ago
Approximate duality of multicommodity multiroute flows and cuts: single source case
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
Petr Kolman, Christian Scheideler
107
Voted
IPL
2008
95views more  IPL 2008»
15 years 3 months ago
Approximating maximum satisfiable subsystems of linear equations of bounded width
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
Zeev Nutov, Daniel Reichman
WAOA
2010
Springer
209views Algorithms» more  WAOA 2010»
15 years 1 months ago
Densest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
Danny Z. Chen, Rudolf Fleischer, Jian Li