Sciweavers

524 search results - page 63 / 105
» Two efficient methods to reduce power and testing time
Sort
View
IJRR
2008
92views more  IJRR 2008»
15 years 4 months ago
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...
ADHOC
2006
116views more  ADHOC 2006»
15 years 4 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski
NAA
2000
Springer
97views Mathematics» more  NAA 2000»
15 years 8 months ago
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
Igor Brainman, Sivan Toledo
BMCBI
2010
118views more  BMCBI 2010»
15 years 4 months ago
Artificial neural networks for the prediction of peptide drift time in ion mobility mass spectrometry
Background: There is an increasing usage of ion mobility-mass spectrometry (IMMS) in proteomics. IMMS combines the features of ion mobility spectrometry (IMS) and mass spectrometr...
Bing Wang, Steve Valentine, Manolo Plasencia, Srir...
MOBIHOC
2004
ACM
16 years 4 months ago
Localized algorithms for energy efficient topology in wireless ad hoc networks
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
Wen-Zhan Song, Yu Wang 0003, Xiang-Yang Li