41 results on '"Pantziou, Grammati"'
Search Results
2. Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows
3. Watershed-Based Clustering for Energy Efficient Data Gathering in Wireless Sensor Networks with Mobile Collector
4. Mobile Sinks for Information Retrieval from Cluster-Based WSN Islands
5. Interactive Cluster-Based Personalized Retrieval on Large Document Collections
6. A Mobility Aware Technique for Clustering on Mobile Ad-Hoc Networks
7. Stable and Energy Efficient Clustering of Wireless Ad-Hoc Networks with LIDAR Algorithm
8. Efficient Active Clustering of Mobile Ad-Hoc Networks
9. Competitive call control in mobile networks
10. On the fault tolerance of fat-trees
11. Dynamic tree routing under the 'matching with consumption' model
12. On-line and dynamic algorithms for shortest path problems
13. Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
14. On the computation of fast data transmissions in networks with capacities and delays
15. Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
16. Parallel h-v drawings of binary trees
17. Efficient sequential and parallel algorithms for the negative cycle problem
18. Pervasive technologies and assistive environments: cognitive systems for assistive environments: special issue of PETRA 2010 and 2011 conferences
19. Fast parallel algorithms for coloring random graphs
20. Computing shortest paths and distances in planar graphs
21. Optimal parallel algorithms for sparse graphs
22. Efficient parallel algorithms for shortest paths in planar graphs
23. Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows
24. Mobile Sinks for Information Retrieval from Cluster-Based WSN Islands
25. A Mobility Aware Technique for Clustering on Mobile Ad-Hoc Networks
26. Stable and Energy Efficient Clustering of Wireless Ad-Hoc Networks with LIDAR Algorithm
27. Efficient Active Clustering of Mobile Ad-Hoc Networks
28. Competitive call control in mobile networks
29. On the fault tolerance of fat-trees
30. Dynamic tree routing under the “matching with consumption” model
31. Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
32. On-line and dynamic algorithms for shortest path problems
33. Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
34. Efficient sequential and parallel algorithms for the negative cycle problem
35. Parallel h-v drawings of binary trees
36. Fast parallel algorithms for coloring random graphs
37. Computing shortest paths and distances in planar graphs
38. Optimal parallel algorithms for sparse graphs
39. Efficient parallel algorithms for shortest paths in planar graphs
40. Fast parallel approximations of the maximum weighted cut problem through derandomization
41. Interactive Cluster-Based Personalized Retrieval on Large Document Collections
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.