Sciweavers

657 search results - page 130 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
DAM
2007
107views more  DAM 2007»
14 years 9 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
TSP
2008
115views more  TSP 2008»
14 years 9 months ago
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
15 years 3 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
WIRN
2005
Springer
15 years 3 months ago
Artificial Immune-Based Optimization Technique for Solving Economic Dispatch in Power System
Abstract. This paper presents an Artificial Immune-based optimization technique for solving the economic dispatch problem in a power system. The main role of electrical power utili...
Titik Khawa Abdul Rahman, Saiful Izwan Suliman, Is...
IPPS
2010
IEEE
14 years 7 months ago
Broadcasting on large scale heterogeneous platforms under the bounded multi-port model
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
Olivier Beaumont, Lionel Eyraud-Dubois, Shailesh K...