The linear search algorithm for the bi-constraint path problem

2005 ◽  
Author(s):  
Pin Zhang
Keyword(s):  
Search Algorithm ◽  
Linear Search

scholarly journals APLIKASI PENGHITUNG UPAH LEMBUR BERDASARKAN JUMLAH WAKTU LEMBUR DENGAN MENGGUNAKAN ALGORITMA LINEAR SEARCH

Petir ◽  
2019 ◽  
Vol 12 (1) ◽  
Author(s):  
Hendra Kurniawan ◽  
Sabar Rudiarto
Keyword(s):  
Information Technology ◽  
Human Resources ◽  
Search Algorithm ◽  
Working Hours ◽  
Linear Search ◽  
Long Time ◽  
Recorded Data

The development of information technology has created many solutions to problems that are often faced in life. An application can help a job and make it easier has encourage companies to use applications that help their work in several departments such as administration and human resources. Some companies have regulations requiring employees to do work more than normal working hours that called overtime. Every employee who does overtime will get overtime wages accordance to the amount of overtime that has been done. But sometimes the late of payments occurred because the calculation of overtime wages takes a long time when many employees did overtime. To solve this problem the company needs an application that can calculate overtime wages quickly and accurately, using the linear search algorithm application will search and process the recorded data in the attendance machine, then calculate overtime wages according to the amount of overtime that has been done. And then it can minimize the occurrence of late payments and more accurate calculations result.

scholarly journals Joint Optimization of Interference Coordination Parameters and Base-Station Density for Energy-Efficient Heterogeneous Networks

Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 2154 ◽  
Author(s):  
Yanzan Sun ◽  
Han Xu ◽  
Shunqing Zhang ◽  
Yating Wu ◽  
Tao Wang ◽  
...  
Keyword(s):  
Low Power ◽  
Heuristic Algorithm ◽  
Heterogeneous Networks ◽  
Search Algorithm ◽  
Power Reduction ◽  
Reduction Factor ◽  
Closed Form Expression ◽  
Interference Coordination ◽  
Linear Search ◽  
Bias Power

Heterogeneous networks (HetNets), consisting of macro-cells and overlaying pico-cells, have been recognized as a promising paradigm to support the exponential growth of data traffic demands and high network energy efficiency (EE). However, for two-tier heterogeneous architecture deployment of HetNets, the inter-tier interference will be challenging. Time domain further-enhanced inter-cell interference coordination (FeICIC) proposed in 3GPP Release-11 becomes necessary to mitigate the inter-tier interference by applying low power almost blank subframe (ABS) scheme. Therefore, for HetNets deployment in reality, the pico-cell range expansion (CRE) bias, the power of ABS and the density of pico base stations (PBSs) are three important factors for the network EE improvement. Aiming to improve the network EE, the above three factors are jointly considered in this paper. In particular, we first derive the closed-form expression of the network EE as a function of pico CRE bias, power reduction factor of low power ABS and PBS density based on stochastic geometry model. Then, the approximate relationship between pico CRE bias and power reduction factor is deduced, followed by a linear search algorithm to get the near-optimal pico CRE bias and power reduction factor together at a given PBS density. Next, a linear search algorithm is further proposed to optimize PBS density based on fixed pico CRE bias and power reduction factor. Due to the fact that the above pico CRE bias and power reduction factor optimization and PBS density optimization are optimized separately, a heuristic algorithm is further proposed to optimize pico CRE bias, power reduction factor and PBS density jointly to achieve global network EE maximization. Numerical simulation results show that our proposed heuristic algorithm can significantly enhance the network EE while incurring low computational complexity.

scholarly journals Two way Linear Search Algorithm

2014 ◽  
Vol 107 (21) ◽  
pp. 6-8 ◽  
Author(s):  
Nitin Arora ◽  
Garima Bhasin ◽  
Neha Sharma
Keyword(s):  
Search Algorithm ◽  
Linear Search

scholarly journals LINEAR SEARCH ALGORITHM TO BE SOLVED BY PARAMETER LOOP

2020 ◽  
Author(s):  
J. Dashdemberel ◽  
◽  
D. Buren-Arvijikh ◽  
Keyword(s):  
Search Algorithm ◽  
Detailed Knowledge ◽  
Automatic Programming ◽  
Linear Search ◽  
Program Language ◽  
Basic Understanding ◽  
Internal Core ◽  
Programming Systems ◽  
The Given ◽  
Algebra Of Sets

There are common occasions for finding out required optional data or element from the given algebra of sets and any kind of systems when we are solving practical and informatics tasks. In order to solve these types of tasks or issues, students or researchers have to know about the methodologies for basic understanding which are called tasks for searching. This process is very important as for finding out basic understanding and methodologies, having detailed knowledge of algorithms and searching methods, although there are modern specific technologies and automatic programming systems. When searching methods are programmedfor informatics tasks, necessary abilities such as seeking essential or import of program language operators and making analysis indifference among characterful solving should be owned by students or specialists. Therefore,I set my purpose of thesis of organizing linear searching algorithms by the parameter loop of the programming language C during the discovering process of identifying differences, patterns, and internal core of linear searching methodologies.

A New Modified Linear Search Algorithm

2019 ◽  
Vol 65 (12) ◽  
pp. 148-152
Author(s):  
Subir Saha ◽  
Mridul K.Bhaumik ◽  
Supratim Das
Keyword(s):  
Search Algorithm ◽  
Linear Search
Sign in / Sign up

Export Citation Format

Share Document