Sciweavers

7930 search results - page 17 / 1586
» Greedy in Approximation Algorithms
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...
CATS
2006
13 years 8 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
STOC
2004
ACM
74views Algorithms» more  STOC 2004»
14 years 7 months ago
On the performance of greedy algorithms in packet buffering
Susanne Albers, Markus Schmidt
RTAS
2007
IEEE
14 years 1 months ago
Real-Time Task Replication for Fault Tolerance in Identical Multiprocessor Systems
Multiprocessor platforms have been widely adopted in both embedded and server systems. In addition to the performance improvement, multiprocessor systems could have the flexibili...
Jian-Jia Chen, Chuan-Yue Yang, Tei-Wei Kuo, Shau-Y...
IRREGULAR
1995
Springer
13 years 11 months ago
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...