Sciweavers

8431 search results - page 399 / 1687
» Algorithmically Independent Sequences
Sort
View
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 6 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...
PC
2000
100views Management» more  PC 2000»
15 years 6 months ago
Parallel optimisation algorithms for multilevel mesh partitioning
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
Chris Walshaw, Mark Cross
ECCC
1998
117views more  ECCC 1998»
15 years 6 months ago
Determinant: Old Algorithms, New Insights
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
Meena Mahajan, V. Vinay
166
Voted
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
15 years 6 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
Maw-Shang Chang
319
Voted
CLUSTER
2011
IEEE
14 years 6 months ago
A mobility-based cluster formation algorithm for wireless mobile ad-hoc networks
  In the last decade, numerous efforts have been devoted to design efficient algorithms for clustering the  wireless mobile ad‐hoc networks (MANET) consider...
Javad Akbari Torkestani, Mohammad Reza Meybodi