Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

83 results for “computational cost”
Set a search alert
Research ArticleOpen accessIn the abstractExplicit Allocation Strategy with Deadline and Budget Constraint Algorithm in Bag of Tasks GridM. Suresh Kumar, T. PurusothamanProblem statement: This study is for effective scheduling of grid jobs based on economy for space shared resources in Bag of tasks grid. Grid Computing aims in combining the power of heterogeneous, geographically distributed, multi-domain computational resources to provide high performance or high throughput. Approach: Space shared resources are parallel supercomputers and clusters of workstations that provides a great amount … …Journal of Computer Science, Vol. 8, Issue 7 · 7 Jun 2012 · 6,229 accessesView PDFCite
Research ArticleOpen accessIn the abstractUsing Hyper Clustering Algorithms in Mobile Network PlanningLamiaa Fattouh Ibrahim, Hesham A. SalmanProblem statement: As a large amount of data stored in spatial databases, people may like to find groups of data which share similar features. Thus cluster analysis becomes an important area of research in data mining. Applications of clustering analysis have been utilized in many fields, such as when we search to construct a cluster served by base station in … …American Journal of Applied Sciences, Vol. 8, Issue 10 · 30 Aug 2011 · 7,504 accessesView PDFCite
Research ArticleOpen accessIn the abstractWeighted Centroid Modified Simplex and Linear Constrained Response Surface Optimization Methods for the Xbar-R Chart Variable DeterminationPongchanun LuangpaiboonProblem statement: Although economic Xbar-R chart designs do guarantee the minimal operating cost, they typically have poor levels of statistical performance measures. The obvious limitation of the economic design is that the Type I error rate seems to be very high for many situations and will cause a large number of false alarms. This situation leads to an investigation of … …Journal of Computer Science, Vol. 7, Issue 6 · 14 Jun 2011 · 7,115 accessesView PDFCite
Research ArticleOpen accessIn the abstractApplication of Hybrid Encoding Genetic Algorithm on Pickup and Delivery Traveling Salesman Problem with Traffic ConditionsSupat PatvichaichodProblem statement: This study deals with the pickup and delivery traveling salesman problem with traffic conditions (PDTSPTW), an extension of the pickup and delivery traveling salesman problem (PDTSP) where each customer to be served is associated with two quantities of product to be collected and delivered. Almost PDTSP problems uses distance between each point of customers as Euclidean Distance and … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 6,779 accessesView PDFCite
Research ArticleOpen accessIn the abstractMeta Heuristic Algorithms for Vehicle Routing Problem with Stochastic DemandsGeetha Shanmugam, Poonthalir Ganesan, Dr. P.T. VanathiProblem statement: The shipment of goods from manufacturer to the consumer is a focal point of distribution logistics. In reality, the demand of consumers is not known a priori. This kind of distribution is dealt by Stochastic Vehicle Routing Problem (SVRP) which is a NP-hard problem. In this proposed work, VRP with stochastic demand is considered. A probability distribution is … …Journal of Computer Science, Vol. 7, Issue 4 · 4 Apr 2011 · 8,021 accessesView PDFCite
Research ArticleOpen accessIn the abstractPAPR Reduction Using BPSO/PTS and STBC in MIMO OFDM SystemKarima El Mouhib, Ahmed Oquour, Younes Jabrane et al.Problem statement: The Multiple Input Multiple Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) system has been receiving a great attention, as one of solutions for achieving high speed, efficient and high-quality service for the wireless communications. However, the transmitted signal still has high PAPR because of OFDM characteristics. Many methods have been proposed to solve this problem, but the most … …Journal of Computer Science, Vol. 7, Issue 4 · 4 Apr 2011 · 7,189 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Scalable and Reliable Cost Effective Key Agreement Protocol for Secure Group CommunicationS. Jabeen Begum, Dr. T. PurusothamanProblem statement: In a heterogeneous environment, for a secure multicast communication, the group members have to share a secret key which is used to encrypt/decrypt the secret messages among the members. The Secure Group Communication of large scale multicast group in a dynamic environment is more complex than securing one-to-one communication due to the inherent scalability issue of group key … …Journal of Computer Science, Vol. 7, Issue 3 · 7 Mar 2011 · 6,960 accessesView PDFCite
Research ArticleOpen accessIn the abstractAdaptive Resonance Theory Training Parameters: Pretty Good SetsTaisir Mohammad Eldos, Abdulaziz Suleiman AlmazyadProblem statement: ART1 artificial neural networks offer good tools for test clustering, where no expert is needed if the system is well trained. However, having no output reference for the input patterns makes it hard to judge the quality of the training. Moreover, the performance depends to a great extent on a set of training parameters. Designers follow some recommendations … …Journal of Computer Science, Vol. 6, Issue 12 · 6 Nov 2010 · 7,155 accessesView PDFCite
Research ArticleOpen accessIn the abstractAcoustic Echo Cancellation: Dual Architecture ImplementationB. Stark, B. D. BarkanaProblem statement: With the rise in mobile communication, it is becoming more frequent to use a communication device in an enclosed noisy environment, such as a subway or in a lobby. In this setting however, the received microphone is severely degraded by the echo from the speaker and background noise. The audio processing necessary to clarify the desired speech can … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,382 accessesView PDFCite
Research ArticleOpen accessIn the abstractSimulated Annealing with Deterministic DecisionsTaisir EldosProblem statement: Simulated Annealing (SA) algorithms have been used in solving a wide range of discrete optimization problems for many years, with well know drawbacks like the computational time and difficulties related to the parameters settings. One of the other issues that open the door for research is the acceptance decision that provides for hill climbing; the standard SA algorithms … …Journal of Computer Science, Vol. 5, Issue 12 · 31 Dec 2009 · 7,119 accessesView PDFCite