Sciweavers

2698 search results - page 77 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
123
Voted
ICCAD
2001
IEEE
107views Hardware» more  ICCAD 2001»
15 years 11 months ago
A Convex Programming Approach to Positive Real Rational Approximation
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
Carlos P. Coelho, Joel R. Phillips, Luis Miguel Si...
170
Voted
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
15 years 7 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom
JGAA
2006
63views more  JGAA 2006»
15 years 2 months ago
A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping
Two-dimensional phase unwrapping is the problem of deducing unambiguous "phase" from values known only modulo 2. Many authors agree that the objective of phase unwrappin...
Reuven Bar-Yehuda, Irad Yavneh
101
Voted
SODA
2000
ACM
125views Algorithms» more  SODA 2000»
15 years 4 months ago
Approximation algorithms for projective clustering
We consider the following two instances of the projective clustering problem: Given a set
Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
15 years 9 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard