Sciweavers

794 search results - page 60 / 159
» Improved algorithms for orienteering and related problems
Sort
View
MOBICOM
1997
ACM
14 years 1 months ago
Log-Time Algorithms for Scheduling Single and Multiple Channel Data Broadcast
With the increasing popularity of portable wireless computers, mechanisms to efficiently transmit information to such clients are of significant interest. The environmentundercons...
Sohail Hameed, Nitin H. Vaidya
CCGRID
2005
IEEE
14 years 2 months ago
n-Cycle: a set of algorithms for task distribution on a commodity grid
— The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates management...
Ladislau Bölöni, Damla Turgut, Dan C. Ma...
STACS
2004
Springer
14 years 2 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
CEC
2010
IEEE
13 years 10 months ago
A modified Invasive Weed Optimization algorithm for time-modulated linear antenna array synthesis
: Time modulated antenna arrays attracted the attention of researchers for the synthesis of low/ultra-low side lobes in recent past. In this article we propose an improved variant ...
Aniruddha Basak, Siddharth Pal, Swagatam Das, Ajit...
TEC
2002
88views more  TEC 2002»
13 years 8 months ago
Parallelism and evolutionary algorithms
Abstract--This paper contains a modern vision of the parallelization techniques used for evolutionary algorithms (EAs). The work is motivated by two fundamental facts: first, the d...
Enrique Alba, Marco Tomassini