Sciweavers

3758 search results - page 263 / 752
» A Complete Subsumption Algorithm
Sort
View
CORR
2007
Springer
107views Education» more  CORR 2007»
15 years 6 months ago
Asynchronous Distributed Searchlight Scheduling
Abstract— This paper develops and compares two asynchronous distributed scheduling algorithms for multiple controlled searchlights in nonconvex polygonal environments. A searchli...
Karl J. Obermeyer, Anurag Ganguli, Francesco Bullo
JCB
2008
170views more  JCB 2008»
15 years 6 months ago
Efficiently Identifying Max-Gap Clusters in Pairwise Genome Comparison
The spatial clustering of genes across different genomes has been used to study important problems in comparative genomics, from identification of operons to detection of homologo...
Xu Ling, Xin He, Dong Xin, Jiawei Han
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 6 months ago
Target assignment for robotic networks: asymptotic performance under limited communication
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
Stephen L. Smith, Francesco Bullo
JEI
2007
90views more  JEI 2007»
15 years 6 months ago
Low-complexity high-performance multiscale error diffusion technique for digital halftoning
Multiscale error diffusion (MED) is superior to conventional error diffusion algorithms as it can eliminate directional hysteresis completely. However, due to its frame-oriented p...
Yik-Hing Fung, Ka-Chun Lui, Yuk-Hee Chan
SIAMDM
2002
124views more  SIAMDM 2002»
15 years 6 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella