Sciweavers

791 search results - page 9 / 159
» Approximating the Maximum Sharing Problem
Sort
View
SPAA
2009
ACM
14 years 8 months ago
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
Melih Onus, Andréa W. Richa
ESA
2005
Springer
136views Algorithms» more  ESA 2005»
14 years 1 months ago
Approximating the 2-Interval Pattern Problem
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...
Maxime Crochemore, Danny Hermelin, Gad M. Landau, ...
CCCG
2009
13 years 8 months ago
Approximating Maximum Flow in Polygonal Domains using Spanners
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
Joondong Kim, Joseph S. B. Mitchell, Jingyu Zou
DATE
1998
IEEE
93views Hardware» more  DATE 1998»
13 years 11 months ago
Exact and Approximate Estimation for Maximum Instantaneous Current of CMOS Circuits
We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact so...
Yi-Min Jiang, Kwang-Ting Cheng
HEURISTICS
2007
165views more  HEURISTICS 2007»
13 years 7 months ago
New heuristics for the maximum diversity problem
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
Geiza C. Silva, Marcos R. Q. de Andrade, Luiz Sato...