Sciweavers

159 search results - page 31 / 32
» Computing minimum cuts by randomized search heuristics
Sort
View
TASE
2010
IEEE
13 years 23 days ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 6 days ago
Takeover times on scale-free topologies
The topological properties of a network directly impact the flow of information through a system. In evolving populations, the topology of inter-individual interactions affects th...
Joshua L. Payne, Margaret J. Eppstein
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
13 years 11 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
ICASSP
2011
IEEE
12 years 9 months ago
A combinatorial optimization framework for subset selection in distributed multiple-radar architectures
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
Hana Godrich, Athina P. Petropulu, H. Vincent Poor
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 6 months ago
A Performance Study of GA and LSH in Multiprocessor Job Scheduling
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
S. R. Vijayalakshmi, G. Padmavathi