-
161
FoGMatch
Published 2019“…Our solution consists of (1) two optimization problems, one for the IoT devices and one for the fog nodes, (2) preference functions for both the IoT and fog layers to help them rank each other on the basis of several criteria such latency and resource utilization, and (3) centralized and distributed intelligent scheduling algorithms that consider the preferences of both the fog and IoT layers to improve the performance of the overall IoT ecosystem. …”
Get full text
Get full text
Get full text
masterThesis -
162
On scalable parallel recursive backtracking
Published 2015“…Solving NP-hard graph problems to optimality using exact algorithms is an example of an area in which there has so far been limited success in obtaining large scale parallelism. …”
Get full text
Get full text
Get full text
article -
163
UAV-Aided Projection-Based Compressive Data Gathering in Wireless Sensor Networks
Published 2018“…Our problem definition aims at clustering the sensors, constructing an optimized forwarding tree per cluster, and gathering the data from selected cluster head nodes based on projection-based CDG with minimized UAV trajectory distance. …”
Get full text
Get full text
Get full text
Get full text
article -
164
Improving the Resilience of Smart Distribution Networks against Cyber Attacks
Published 2022Get full text
doctoralThesis -
165
MoveSchedule
Published 1995“…The layout construction algorithm that underlies MoveSchedule uses Constraint Satisfaction to find the set of all positions that meet the constraints on resources' positions and Linear Programming to find the optimal positions that minimize resource transportation and relocation costs. …”
Get full text
Get full text
Get full text
masterThesis -
166
Practical Multiple Node Failure Recovery in Distributed Storage Systems
Published 2016“…We allocate newcomers to nodes with minimal computations and without changing the original optimized plan. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
167
ISSP
Published 2017“…The underlying algorithms optimize positions of resources by minimizing handling and rehandling costs of these on site. …”
Get full text
Get full text
Get full text
conferenceObject -
168
On the complexity of bilinear computations
Published 1984“…One can show that we can restrict ourselves to bilinear algorithms. Brockett and Dobkin showed that the problem is equivalent to minimizing the number of rank one matrices that generate a given set of matrices. …”
Get full text
Get full text
Get full text
masterThesis -
169
Dynamic multiple node failure recovery in distributed storage systems
Published 2018“…We present a range of results for our proposed algorithms in several scenarios to assess the effectiveness of the solution approaches that are shown to generate results close to optimal.…”
Get full text
Get full text
Get full text
Get full text
article -
170
Virtualizing and Scheduling FPGA Resources in Cloud Computing Datacenters
Published 2021Get full text
doctoralThesis -
171
Hybrid deep learning based threat intelligence framework for Industrial IoT systems
Published 2025“…The proposed approach was also compared against several contemporary deep learning-based architectures and existing benchmark algorithms. The results indicate that the proposed method achieves superior detection accuracy, with only a minimal compromise in speed efficiency. …”