Sciweavers

429 search results - page 16 / 86
» Improved Algorithms for the k Maximum-Sums Problems
Sort
View
HIS
2009
14 years 7 months ago
Improved Harmony Search for Economic Power Dispatch
This paper presents a novel optimization approach using Improved Harmony Search (IHS) algorithm to solve economic power dispatch problem. The proposed methodology easily takes care...
V. Ravikumar Pandi, Bijaya K. Panigrahi, Manas Kum...
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
15 years 3 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
ICCAD
1995
IEEE
135views Hardware» more  ICCAD 1995»
15 years 1 months ago
An iterative improvement algorithm for low power data path synthesis
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
Anand Raghunathan, Niraj K. Jha
SIAMCOMP
2012
13 years 6 days ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
IWPEC
2009
Springer
15 years 4 months ago
Improved Induced Matchings in Sparse Graphs
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Wal...