Sciweavers

2814 search results - page 178 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
HPCN
1995
Springer
15 years 4 months ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck
IPPS
1998
IEEE
15 years 5 months ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
COMCOM
2006
114views more  COMCOM 2006»
15 years 1 months ago
A comparison of epidemic algorithms in wireless sensor networks
We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is nece...
Mert Akdere, Cemal Çagatay Bilgin, Ozan Ger...
107
Voted
IJACTAICIT
2010
189views more  IJACTAICIT 2010»
14 years 10 months ago
An Improved Algorithm for Data Hiding Using HH-subband Haar Wavelet Coefficients
This paper presents an improved adaptive algorithm for enhanced data hiding under HH-subband Haar Wavelet coefficients of a gray scale host image. The algorithm uses an optimal se...
Stuti Bazaj, Sachin Modi, Anand Mohan, S. P. Singh
HPDC
2007
IEEE
15 years 7 months ago
Precise and realistic utility functions for user-centric performance analysis of schedulers
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
Cynthia Bailey Lee, Allan Snavely