Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: J Supercomput

Search In Journal Title:

Abbravation: The Journal of Supercomputing

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1016/j.apcatb.2005.12.009

Search In DOI:

ISSN

1573-0484

Search In ISSN:
Search In Title Of Papers:

A learning automatabased heuristic algorithm for 

Authors: Javad Akbari Torkestani Mohammad Reza Meybodi
Publish Date: 2010/10/07
Volume: 59, Issue: 2, Pages: 1035-1054
PDF Link

Abstract

During the last decades a host of efficient algorithms have been developed for solving the minimum spanning tree problem in deterministic graphs where the weight associated with the graph edges is assumed to be fixed Though it is clear that the edge weight varies with time in realistic applications and such an assumption is wrong finding the minimum spanning tree of a stochastic graph has not received the attention it merits This is due to the fact that the minimum spanning tree problem becomes incredibly hard to solve when the edge weight is assumed to be a random variable This becomes more difficult if we assume that the probability distribution function of the edge weight is unknown In this paper we propose a learning automatabased heuristic algorithm to solve the minimum spanning tree problem in stochastic graphs wherein the probability distribution function of the edge weight is unknown The proposed algorithm taking advantage of learning automata determines the edges that must be sampled at each stage As the presented algorithm proceeds the sampling process is concentrated on the edges that constitute the spanning tree with the minimum expected weight The proposed learning automatabased sampling method decreases the number of samples that need to be taken from the graph by reducing the rate of unnecessary samples Experimental results show the superiority of the proposed algorithm over the wellknown existing methods both in terms of the number of samples and the running time of algorithm

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Fault-tolerant broadcast in anonymous systems
  2. A hyper-heuristic approach for resource provisioning-based scheduling in grid environment
  3. Constructing data supply chain based on layered PROV
  4. A localization algorithm for large scale mobile wireless sensor networks: a learning approach
  5. Comment on “A general model for long-tailed network traffic approximation”
  6. Direct private query in location-based services with GPU run time analysis
  7. A randomized clustering of anonymous wireless ad hoc networks with an application to the initialization problem
  8. GPU-based parallel genetic approach to large-scale travelling salesman problem
  9. SENFIS: a Sensor Node File System for increasing the scalability and reliability of Wireless Sensor Networks applications
  10. The panconnectivity and the pancycle-connectivity of the generalized base- b hypercube
  11. 3-Hierarchical resource management model on web grid service architecture
  12. Research challenges and perspectives on Wisdom Web of Things (W2T)
  13. A novel framework for social web forums’ thread ranking based on semantics and post quality features
  14. Conditional forwarding: simple flow control to increase adaptivity for fully adaptive routing algorithms
  15. A proposal on location data supplementing information transfer method over MANET
  16. A framework for SaaS software packages evaluation and selection with virtual team and BOCR of analytic network process
  17. Real-time blind audio source separation: performance assessment on an advanced digital signal processor
  18. High-efficient video compression for social multimedia distribution
  19. RCB: leakage-resilient authenticated encryption via re-keying
  20. A framework for efficient performance prediction of distributed applications in heterogeneous systems
  21. Reducing the search space by closure and simplification paradigms
  22. P2P resource searching with Cloning Random Walker assisted by Weakly Connected Dominating Set
  23. Cost and energy aware service provisioning for mobile client in cloud computing environment
  24. PerContRep: a practical reputation system for pervasive content services
  25. Task scheduling for heterogeneous computing systems
  26. Integrating 3D image descriptors of margin sharpness and texture on a GPU-optimized similar pulmonary nodule retrieval engine
  27. Exploring the speedups of embedded microprocessor systems utilizing a high-performance coprocessor data-path
  28. Tuning remote GPU virtualization for InfiniBand networks
  29. Energy efficient utilization of resources in cloud computing systems
  30. The election problem in asynchronous distributed systems with bounded faulty processes
  31. Dynamic-width reconfigurable parallel prefix circuits
  32. Editorial: special issue on parallel nature-inspired optimization
  33. Combating I-O bottleneck using prefetching: model, algorithms, and ramifications
  34. Editorial of special section on advanced in high performance, algorithm, and framework for future computing
  35. Hierarchical multichannel-based integrated smart metering infrastructure
  36. Distributed identification of the lineality space of a cone
  37. On studying business models in mobile social networks based on two-sided market (TSM)
  38. Reconfiguration process and routing management for service platforms
  39. Scheduling array redistribution with virtual channel support
  40. A case study of Grid Computing and computer algebra: parallel Gröbner Bases and Characteristic Sets
  41. A rhythm-based access control system for secure wellness services
  42. A novel Adaptive Cluster Transformation (ACT)-based intrusion tolerant architecture for hybrid information technology
  43. Panconnectivity of Cartesian product graphs
  44. Efficient search algorithms for RNAi target detection
Search Result: