Search Results - (( dynamic bandwidth optimisation algorithm ) OR ( dynamic candidate determination algorithm ))

Efficient distance computation algorithm between nearly intersected objects using dynamic pivot point in virtual environment application by Hamzah Asyrani Sulaiman, Abdullah Bade, Mohd Harun Abdullah

Get full text
Get full text
Get full text
Get full text

Efficient distance computation algorithm between nearly intersect objects using dynamic pivot point in virtual environment application by Sulaiman, Hamzah Asyrani, Bade, Abdullah, Abdullah, Mohd Harun

Get full text
Get full text

Enhancing Harmony Search Parameters Based On Step And Linear Function For Bus Driver Scheduling And Rostering Problems by Mansor, Nur Farraliza

“…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
Get full text
Get full text
Get full text
Get full text

A Two-Layer Framework for Mitigating the Congestion of Urban Power Grids Based on Flexible Topology with Dynamic Thermal Rating by Su Y., Teh J., Luo Q., Tan K., Yong J.

“…The optimum transitioning sequence between the initial and optimum topologies is also determined by the two-layer framework to minimize voltage deviation and line overloading of the UPG considering dynamic thermal rating. …”

Dynamic channel selection for meshed wireless personal area network by Abdul Lateef, Ahmed

“…A Dynamic Channel Selection Algorithm has been suggested. …”
Get full text
Get full text
Get full text

Making location-aware computing working accurately in smart spaces by Mantoro, Teddy, Ayu, Media Anugerah, Weyn, Maarten

“…Unfortunately, the signal strength, signals quality and noise of Wi-Fi, in worst scenario, it fluctuates up to 33% because of the reflection, refraction, temperature, humidity, the dynamic environment, etc. We present our current development on a light-weight algorithm, which is easy, simple but robust in producing the determination of user location using WiFi signals. …”
Get full text
Get full text
Get full text

Improving the accuracy of indoor user location using IEEE 802.11 signals by Mantoro, Teddy, Ayu, Media Anugerah

“…This study presents our current development on a light-weight algorithm, which is designed to be easy, simple but robust in producing the determination of user location. …”
Get full text
Get full text
Get full text

A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

“…Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
Get full text

A multi-color based features from facial images for automatic ethnicity identification model by Mohd Zamri, Osman, Mohd Aizaini, Maarof, Mohd Foad, Rohani, Nilam Nur Amir, Sjarif, Nor Saradatul Akmar, Zulkifli

“…In the feature extraction process, a dynamic skin color detection is adapted to extract the skin color information from the face candidate. …”
Get full text
Get full text
Get full text

Efficient reconfigurable architectures for 3-D medical image compression by Ahmad, Afandi

“…These applications require continuous hardware servicing, and as a result dynamic partial recon�guration (DPR) has been introduced. …”
Get full text
Get full text