oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 3 )

2018 ( 33 )

2017 ( 22 )

2016 ( 40 )

Custom range...

Search Results: 1 - 10 of 1997 matches for " algorithms "
All listed articles are free for downloading (OA Articles)
Page 1 /1997
Display every page Item
Practical Considerations for Wireless Sensor Network Algorithms  [PDF]
Gertjan Halkes, Koen Langendoen
Wireless Sensor Network (WSN) , 2010, DOI: 10.4236/wsn.2010.26055
Abstract: Many researchers from different backgrounds have found interesting research challenges that arise from the physical constraints and envisaged applications in Wireless Sensor Networks (WSNs). The WSN community that has formed over the years is divided into two sub-communities: the systems sub-community and the theory sub-community. However, there seems to be no connection between the two. Algorithms developed from a theoretic perspective are rarely implemented on real hardwares. In this paper we identify the most important reasons why these algorithms are disregarded by the systems sub-community, and provide pointers to remedy the lack of connection.
Optimization of UMTS Network Planning Using Genetic Algorithms  [PDF]
Fabio Garzia, Cristina Perna, Roberto Cusani
Communications and Network (CN) , 2010, DOI: 10.4236/cn.2010.23028
Abstract: The continuously growing of cellular networks complexity, which followed the introduction of UMTS technology, has reduced the usefulness of traditional design tools, making them quite unworthy. The purpose of this paper is to illustrate a design tool for UMTS optimized net planning based on genetic algorithms. In particular, some utilities for 3G net designers, useful to respect important aspects (such as the environmental one) of the cellular network, are shown.
Algorithms for Computing Some Invariants for Discrete Knots  [PDF]
Gabriela Hinojosa, David Torres, Rogelio Valdez
Applied Mathematics (AM) , 2013, DOI: 10.4236/am.2013.411206
Abstract: Given a cubic knot K, there exists a projection \"\" of the Euclidean space R3 onto a suitable plane \"\" such that p(K) is a knot diagram and it can be described in a discrete way as a cycle permutation. Using this fact, we develop an algorithm for computing some invariants for K: its fundamental group, the genus of its Seifert surface and its Jones polynomial.
A Polynomial Algorithm of Optimum Cutting a Rectangle into Rectangles with Two Heights  [PDF]
M. Z. Arslanov
American Journal of Operations Research (AJOR) , 2014, DOI: 10.4236/ajor.2014.41003
Abstract:

We consider the problem of guillotine cutting a rectangular sheet into rectangular pieces with two heights. A polynomial time algorithm for this problem is constructed.

A Cellular Automata Models of Evolution of Transportation Networks
Pawel Topa,Mariusz Paszkowski
Computer Science , 2002,
Abstract: We present a new approach to modelling of transportation networks. Supply of resources and their influence on the evolution of the consuming environment is a princqral problem considered. ne present two concepts, which are based on cellular automata paradigm. In the first model SCAM4N (Simple Cellular Automata Model of Anastomosing Network), the system is represented by a 2D mesh of elementary cells. The rules of interaction between them are introduced for modelling ofthe water flow and other phenomena connected with anastomosing river: Due to limitations of SCAMAN model, we introduce a supplementary model. The MANGraCA (Model of Anastomosing Network with Graph of Cellular Automata) model beside the classical mesh of automata, introduces an additional structure: the graph of cellular automata, which represents the network pattern. Finally we discuss the prospective applications ofthe models. The concepts of juture implementation are also presented.
Um algoritmo evolutivo híbrido para a forma??o de células de manufatura em sistemas de produ??o
Trindade, áthila Rocha;Ochi, Luiz Satoru;
Pesquisa Operacional , 2006, DOI: 10.1590/S0101-74382006000200005
Abstract: the manufacturing cell formation problem (mcfp) is a crucial component of a cell production design in a manufacturing system. this problem is composed by a set of parts of products to be manufactured and machines. the objective is to construct manufacturing clusters by associating products with cell machines. this paper presents a new hybrid evolutionary algorithm to solve the mcfp. computational results with the proposed algorithm on a set of instances available in the literature are also presented. for 8 out of 36 instances considered, the propose method overcame the previous results from the literature and for 26 instances, the same best solutions were found.
Efficient Strategies for Optimization with Genetic Algorithms
Hans- Joachim Bungartz,Igor Trajkovski
Sel?uk Journal of Applied Mathematics , 2002,
Abstract: Evolutionary strategies in general and genetic algorithms in particular have turned out to be of increasing relevance for various classes of optimization problems like combinatory problems as a discrete example or shape optimization as a continuous example. In this paper, we present efficient and powerful strategies for genetic algorithms and their application to two classes of optimization problems. Besides algorithmic aspects concerning the genetic essentials, the focus is put on the efficient implementation, both of the sequential and of the parallel versions.
Recent Advances in Global Optimization for Combinatorial Discrete Problems  [PDF]
Adel R. Awad, Samia O. Chiban
Applied Mathematics (AM) , 2015, DOI: 10.4236/am.2015.611162
Abstract: The optimization of discrete problems is largely encountered in engineering and information domains. Solving these problems with continuous-variables approach then convert the continuous variables to discrete ones does not guarantee the optimal global solution. Evolutionary Algorithms (EAs) have been applied successfully in combinatorial discrete optimization. Here, the mathematical basics of real-coding Genetic Algorithm are presented in addition to three other Evolutionary Algorithms: Particle Swarm Optimization (PSO), Ant Colony Algorithms (ACOA) and Harmony Search (HS). The EAs are presented in as unifying notations as possible in order to facilitate understanding and comparison. Our combinatorial discrete problem example is the famous benchmark case of New-York Water Supply System WSS network. The mathematical construction in addition to the obtained results of Real-coding GA applied to this case study (authors), are compared with those of the three other algorithms available in literature. The real representation of GA, with its two operators: mutation and crossover, functions significantly faster than binary and other coding and illustrates its potential as a substitute to the traditional optimization methods for water systems design and planning. The real (actual) representation is very effective and provides two near-optimal feasible solutions to the New York tunnels problem. We found that the four EAs are capable to afford hydraulically-feasible solutions with reasonable cost but our real-coding GA takes more evaluations to reach the optimal or near-optimal solutions compared to other EAs namely the HS. HS approach discovers efficiently the research space because of the random generation of solutions in every iteration, and the ability of choosing neighbor values of solution elements “changing the diameter of the pipe to the next greater or smaller commercial diameter” beside keeping good current solutions. Our proposed promising point to improve the performance of GA is by introducing completely new individuals in every generation in GA using a new “immigration” operator beside “mutation” and “crossover”.
Automated Watershed Evaluation of Flat Terrain  [PDF]
Sameh W. Al-Muqdadi, Broder J. Merkel
Journal of Water Resource and Protection (JWARP) , 2011, DOI: 10.4236/jwarp.2011.312099
Abstract: Catchment area and watershed delineation is a common task in hydrology. The determination of the catchment is still as a challenge considered being crucial key issues particular in flat terrains. Three concepts could be briefly identified through: the manual delineation of a catchment based on a topographic map with contour lines which is a difficult task for flat terrains, by combination of field survey or evaluation of satellite images. The present research is focus on evaluating the possibility to delineate catchments from flat and arid areas by means of DTM avoiding hard techniques like river burning or other manual hydrological DTM corrections. Three GIS packages were used (Arc Hydrotools, TNTmips and RiverTools) within two DEM: the 90 m and 30 m SRTM in addition to the ASTER 30 m, the application sample presented by western Iraq desert—Ubaiydh wadi. A brief review is given how the delineation algorithms have been developed since the 1980’s. Where result shows that automated watershed analysis of flat terrains is cannot be done without manual evaluation and correction either by using several seeding points or river burning technique.
Genetic Algorithms-based Optimization of Cable Stayed Bridges  [PDF]
Venkat Lute, Akhil Upadhyay, Krishna Kumar Singh
Journal of Software Engineering and Applications (JSEA) , 2011, DOI: 10.4236/jsea.2011.410066
Abstract: Optimum design of cable stayed bridges depends on number of parameters. Design of Cable stayed bridge satisfying all practical constraints is challenging to the designers. Considering the huge number of design variables and practical constraints, Genetic Algorithms (GA) is most suitable for optimizing the cable stayed bridge. In the present work the optimum design is carried out by taking total material cost of bridge as objective function. During problem formulation most of the practical design variables and constraints are considered. Using genetic algorithms some parametric studies such as effect of geometric nonlinearity, effect of grouping of cables, effect of practical site constraints on tower height and side span, effect of bridge material, effect of cable layout, effect of extra-dosed bridges on optimum relative cost have been presented. Data base is prepared for new designers to estimate the relative cost of bridge.
Page 1 /1997
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.