Results 11 to 20 of about 43,488 (185)

A Recursive and Parallelized Dynamic Programming Implementation of Hard Merkle-Hellman Knapsack System for Public Key Cryptography

open access: yesCybernetics and Information Technologies, 2021
Merkle-Hellman public key cryptosystem is a long-age old algorithm used in cryptography. Despite being computationally fast, for very large input sizes it may operate slower due to thread creation overhead or reaching a deadlock situation. In this paper,
Rahul Vaddadi Sai   +2 more
doaj   +1 more source

Exploiting Nature-Inspired-Based Artificial Intelligence Techniques for Coordinated Day-Ahead Scheduling to Efficiently Manage Energy in Smart Grid

open access: yesIEEE Access, 2019
The increasing load demand in residential area and irregular electricity load profile encouraged us to propose an efficient Home Energy Management System (HEMS) for optimal scheduling of home appliances.
Zahoor Ali Khan   +5 more
doaj   +1 more source

A db-Scan Hybrid Algorithm: An Application to the Multidimensional Knapsack Problem

open access: yesMathematics, 2020
This article proposes a hybrid algorithm that makes use of the db-scan unsupervised learning technique to obtain binary versions of continuous swarm intelligence algorithms.
José García   +3 more
doaj   +1 more source

Real Time Information Based Energy Management Using Customer Preferences and Dynamic Pricing in Smart Homes

open access: yesEnergies, 2016
This paper presents real time information based energy management algorithms to reduce electricity cost and peak to average ratio (PAR) while preserving user comfort in a smart home. We categorize household appliances into thermostatically controlled (tc)
Muhammad Babar Rasheed   +7 more
doaj   +1 more source

Towards Optimization of Metaheuristic Algorithms for IoT Enabled Smart Homes Targeting Balanced Demand and Supply of Energy

open access: yesIEEE Access, 2019
Internet of Things enabled smart grid (SG) is one of the most advanced technologies, which plays a key role in maintaining a balance between demand and supply by implementing demand response (DR) program.
Saqib Kazmi   +5 more
doaj   +1 more source

Improved Online Algorithms for Knapsack and GAP in the Random Order Model [PDF]

open access: yes, 2019
The knapsack problem is one of the classical problems in combinatorial optimization: Given a set of items, each specified by its size and profit, the goal is to find a maximum profit packing into a knapsack of bounded capacity.
Albers, Susanne   +2 more
core   +2 more sources

Analisa Kombinasi Algoritma Merkle-Hellman Knapscak dan Logaritma Diskrit pada Aplikasi Chat

open access: yesJurnal Teknologi Informasi dan Ilmu Komputer, 2018
Informasi melalui jaringan internet sangat rentan terhadap penyadapan oleh pihak yang tidak bertanggung jawab. Agar informasi tersebut aman, maka dibutuhkan teknik kriptografi untuk melindungi dan mengamankan informasi tersebut.
Aminudin Aminudin   +2 more
doaj   +1 more source

A hybrid guided neighborhood search for the disjunctively constrained knapsack problem

open access: yesCogent Engineering, 2015
In this paper, we investigate the use of a hybrid guided neighborhood search for solving the disjunctively constrained knapsack problem. The studied problem may be viewed as a combination of two NP-hard combinatorial optimization problems: the weighted ...
Mhand Hifi, Sagvan Saleh, Lei Wu
doaj   +1 more source

An Efficient Power Scheduling Scheme for Residential Load Management in Smart Homes

open access: yesApplied Sciences, 2015
In this paper, we propose mathematical optimization models of household energy units to optimally control the major residential energy loads while preserving the user preferences. User comfort is modelled in a simple way, which considers appliance class,
Muhammad Babar Rasheed   +5 more
doaj   +1 more source

Matroid and Knapsack Center Problems [PDF]

open access: yes, 2013
In the classic $k$-center problem, we are given a metric graph, and the objective is to open $k$ nodes as centers such that the maximum distance from any vertex to its closest center is minimized.
A. Schrijver   +15 more
core   +1 more source

Home - About - Disclaimer - Privacy