• 1
  • 2
  • 5
  • 6
  • 3
  • 4
IPM
30
YEARS OLD

“Papers of School of Computer Science”

Back to Papers Home
 

Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

  11. M. Karegar, H. Poormahammadi, L. Pirhaji, M. Sadeghi, H. Pezashk and C. Eslahchi,
evolutionary heuristic and exact algorithms for haplotype reconstruction problem using menimum error corrction medel,
MATCH Communication in Methematical and in Computer Chemistry  (to appear) [abstract]

   12. F. Zare-Mirakabad, M. Sadeghi, H. Ahrabian and A. Nowzari-Dalini,
RNAComp: A New Method for RNA Secondary Structure Alignment,
MATCH Communication in Methematical and in Computer Chemistry  (to appear) [abstract]

   13. C. Eslahchi, M. Sadeghi, H. Pezesh, M. Karegar and H. Poormohammadi,
Haplotyping Problem, A Clustering Approach,
  (to appear) [abstract]

   14. L. Pirhaji, M. Haregar, A. Sheari, H. Poormahammadi, M. Sadeghi, H. Pezashk and C. Eslahchi,
the performance of chi-square test and complexity measures for signal edongnition in biological sequences,
Journal of Theoretical Biology  (to appear) [abstract]

   15. A. Abbasi, A. Khonsari and M. S. Talebi,
flooding-assisted threshold assignment for aggregate monitoring in sensor networks,
  (to appear) [abstract]

   16. A. Abbasi, M. S. Talebi and A. Khonsari,
Source location anatomy for sensor networks,
  (to appear) [abstract]

   17. N. Alzeidi, M. Ould-Khaoua and A. Khonsari,
Performance Modelling of Torus Interconnection Networks With Deep Buffers,
International Journal of Computers and Applications  (to appear) [abstract]

   18. J. Shahparian, I. Mirrezaei and M. Ghodsi,
Topology-Aware Routing In Skip List Based Distributed Data Structures,
in: CSICC, , 2009, pp.   [abstract]

   19. I. Mirrazaei, J. Shahparian and M. Ghodsi,
Load Balancing in RAQNet, a Multidimensional P2P Network(in Persian),
  (to appear) [abstract]

   20. H. Akbari, Z. Iranmanesh and M. Ghodsi,
Parallel Minimum Spanning Tree Heuristic for the Steiner Problem in Graphs,
  (to appear) [abstract]

   back to top  

Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
scroll left or right