-
501
A method for data path synthesis using neural networks
Published 2017“…A sequential simulator was implemented for the proposed algorithm on a Linux Pentium PC under X Windows. Several circuits hare been attempted, all yielding sub-optimal solutions.…”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
502
AI-Augmented Metasurface Synthesis for Dynamic Beam Steering in Reconfigurable Antenna Arrays
Published 2025“…As compared to the conventional heuristic methods, for example, genetic algorithms (GA), particle swarm optimization (PSO), the approach based on DRLs has rapid policy convergence, has relatively less computational latency, and is autonomous to adapt to dynamic wireless conditions. …”
Get full text
Get full text
article -
503
An Evolutionary Meta-Heuristic for State Justification in Sequential Automatic Test Pattern Generation
Published 2001“…Evolutionary algorithms have been effective in solving many search and optimization problems. …”
Get full text
article -
504
Shuffled Linear Regression with Erroneous Observations
Published 2019“…We propose an optimal recursive algorithm that updates the estimate from the underdetermined function that is based on that permutation-invariant constraint. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
505
Multi Agent Reinforcement Learning Approach for Autonomous Fleet Management
Published 2019Get full text
doctoralThesis -
506
Security in wire/wireless networks: sniffing attacks prevention/detection techniques in LAN networks & the effect on biometric technology
Published 2010“…In our research, we evaluated the most famous security solutions and classifying them according to their efficiency against detecting or preventing the types of Address Resolution Protocol [ARP] Spoofing attacks. Based on the surprising experimental results done by a previous study in the security lab which proposed an optimal algorithm to enhance their ability against the two famous network attacks; we implemented the proposed algorithm by this study and stimulate the experiment in order to test the algorithm performance. …”
Get full text
-
507
Nested ensemble selection: An effective hybrid feature selection method
Published 2023“…Numerical experiments on synthetic and real-life data demonstrate the effectiveness of the proposed method. The NES algorithm achieves perfect precision on the synthetic data and near optimal accuracy on the real-life data. …”
Get full text
article -
508
Mobile robots obstacles avoidance using dynamic window approach
Published 2018Get full text
doctoralThesis -
509
Design and development of an embedded controller for roboticmanipulator
Published 1998“…Mohseni's Proposed Algorithm, MPA, has been incorporated into the embedded controller to reduce the computational efforts and to obtain a close-to-optimal control law. …”
Get full text
Get full text
article -
510
Multidimensional Gains for Stochastic Approximation
Published 2019“…The two algorithms assume full knowledge of the Jacobian. The recursive algorithms are proposed for generating the optimal iterative-dependent matrix gain. …”
Get full text
Get full text
Get full text
Get full text
article -
511
Performance driven standard-cell placement using the geneticalgorithm
Published 1995“…In this paper we present a timing-driven placer for standard-cell IC design. The placement algorithm follows the genetic paradigm. Besides optimizing for area and wire length, the placer minimizes the propagation delays on a predicted set of critical paths. …”
Get full text
Get full text
article -
512
An evolutionary meta-heuristic for state justification insequential automatic test pattern generation
Published 2001“…Evolutionary algorithms have been effective in solving many search and optimization problems. …”
Get full text
Get full text
article -
513
Iterative heuristics for multiobjective VLSI standard cellplacement
Published 2001“…We employ two iterative heuristics for the optimization of VLSI standard cell placement. These heuristics are based on genetic algorithms (GA) and tabu search (TS) respectively. …”
Get full text
Get full text
article -
514
The bus sightseeing problem
Published 2023“…A mixed-integer programming formulation for the BSP is provided and solved by a Benders decomposition algorithm. For large-scale instances, an iterated local search based metaheuristic algorithm is developed with some tailored neighborhood operators. …”
-
515
Traffic Offloading with Channel Allocation in Cache-Enabled Ultra-Dense Wireless Networks
Published 2018“…We also propose efficient sub-optimal hierarchical tree-based algorithms that operate in real time with dynamic and fast solutions for ultra dense networks. …”
Get full text
Get full text
Get full text
Get full text
article -
516
Differential Evolution and Its Applications in Image Processing Problems: A Comprehensive Review
Published 2022“…Differential evolution (DE) is one of the highly acknowledged population-based optimization algorithms due to its simplicity, user-friendliness, resilience, and capacity to solve problems. …”
Get full text
-
517
EVOLUTIONARY HEURISTICS FOR MULTIOBJECTIVE VLSI NETLIST BI-PARTITIONING
Published 2020“…These heuristics are based on Genetic Algorithms (GAs) and Tabu Search (TS) [sadiq et al., 1999] respectively. …”
Get full text
article -
518
MSD-NAS: multi-scale dense neural architecture search for real-time pedestrian lane detection
Published 2023“…The proposed method designs an optimized deep network with multi-scale input branches, allowing the derived network to utilize local and global contexts for predictions. …”
-
519
Design and simulation of superdirective adaptive antenna arrays
Published 1990“…These characteristics were made possible by means of both amplitude and phase variations, based on predetermined optimized array polynomials. …”
Get full text
Get full text
article -
520
User-centric strategies for resource management in heterogeneous wireless networks with QoS considerations
Published 2017“…Due to the complexity of the problem, we design sub-optimal hierarchical tree-based algorithms for real-time operation taking into account realistic constraints. …”
Get full text
Get full text
Get full text
masterThesis