Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- University of Nebraska - Lincoln (48)
- Technological University Dublin (45)
- Singapore Management University (19)
- University of South Carolina (17)
- Old Dominion University (12)
-
- Chapman University (11)
- University of Dayton (10)
- Marquette University (9)
- Manipal Academy of Higher Education (7)
- Purdue University (7)
- Florida International University (6)
- Portland State University (6)
- Michigan Technological University (5)
- Western University (5)
- Ateneo de Manila University (4)
- Fordham University (4)
- Kean University (4)
- San Jose State University (4)
- Air Force Institute of Technology (3)
- Indian Statistical Institute (3)
- Southwestern Oklahoma State University (3)
- University of Nevada, Las Vegas (3)
- City University of New York (CUNY) (2)
- Embry-Riddle Aeronautical University (2)
- Liberty University (2)
- Loyola University Chicago (2)
- Missouri University of Science and Technology (2)
- Morehead State University (2)
- Sacred Heart University (2)
- Tennessee State University (2)
- Keyword
-
- Machine learning (10)
- Deep learning (9)
- IoT (9)
- Blockchain (5)
- Cybersecurity (5)
-
- Deep Learning (5)
- Department of Applied Computing (5)
- Department of Electrical and Computer Engineering (5)
- Security (5)
- Classification (4)
- Empirical software engineering (4)
- Explainability (4)
- Human-computer interaction (4)
- Internet of Things (4)
- Machine Learning (4)
- Robotics (4)
- Simulation (4)
- Testbeds (4)
- Transformers (4)
- Computer vision (3)
- Electrical Engineering (3)
- Electroencephalography (3)
- Eye-tracking (3)
- Introduction to quantum computing (3)
- Linear algebra for quantum computing (3)
- Natural Language Processing (3)
- Performance (3)
- Privacy (3)
- Quantum Computer Programming (3)
- Quantum computing for beginners (3)
- Publication
-
- Dissertations (20)
- Articles (19)
- Research Collection School Of Computing and Information Systems (19)
- Publications (17)
- Department of Electrical and Computer Engineering: Faculty Publications (14)
-
- Department of Computer Science and Engineering: Dissertations, Theses, and Student Research (12)
- Electrical and Computer Engineering Faculty Publications (11)
- Department of Electrical and Computer Engineering: Dissertations, Theses, and Student Research (9)
- Electrical and Computer Engineering Faculty Research and Publications (9)
- Engineering Faculty Articles and Research (8)
- Faculty Publications (8)
- Conference papers (6)
- Department of Electrical and Computer Engineering Faculty Publications (6)
- FIU Electronic Theses and Dissertations (6)
- CSE Conference and Workshop Papers (5)
- Electrical and Computer Engineering Publications (5)
- Honors Theses (5)
- Michigan Tech Publications (5)
- Technical Collection (5)
- Center for Cybersecurity (4)
- Faculty Research, Scholarly, and Creative Activity (4)
- Department of Information Systems & Computer Science Faculty Publications (3)
- Electrical & Computer Engineering Faculty Publications (3)
- Electrical and Computer Engineering Faculty Publications and Presentations (3)
- Engineering Management & Systems Engineering Faculty Publications (3)
- Engineering Technology Faculty Publications (3)
- Patents (3)
- Chemical Engineering and Materials Science Faculty Research Publications (2)
- Chemistry Faculty Research & Creative Works (2)
- Civil and Environmental Engineering and Construction Faculty Research (2)
Articles 271 - 273 of 273
Full-Text Articles in Engineering
A Literature Review On Combining Heuristics And Exact Algorithms In Combinatorial Optimization, Hesamoddin Tahami, Hengameh Fakhravar
A Literature Review On Combining Heuristics And Exact Algorithms In Combinatorial Optimization, Hesamoddin Tahami, Hengameh Fakhravar
Engineering Management & Systems Engineering Faculty Publications
There are several approaches for solving hard optimization problems. Mathematical programming techniques such as (integer) linear programming-based methods and metaheuristic approaches are two extremely effective streams for combinatorial problems. Different research streams, more or less in isolation from one another, created these two. Only several years ago, many scholars noticed the advantages and enormous potential of building hybrids of combining mathematical programming methodologies and metaheuristics. In reality, many problems can be solved much better by exploiting synergies between these approaches than by “pure” classical algorithms. The key question is how to integrate mathematical programming methods and metaheuristics to achieve such …
Spectrum Sensing With Energy Detection In Multiple Alternating Time Slots, Călin Vlădeanu, Alexandru Marţian, Dimitrie C. Popescu
Spectrum Sensing With Energy Detection In Multiple Alternating Time Slots, Călin Vlădeanu, Alexandru Marţian, Dimitrie C. Popescu
Electrical & Computer Engineering Faculty Publications
Energy detection (ED) represents a low complexity approach used by secondary users (SU) to sense spectrum occupancy by primary users (PU) in cognitive radio (CR) systems. In this paper, we present a new algorithm that senses the spectrum occupancy by performing ED in K consecutive sensing time slots starting from the current slot and continuing by alternating before and after the current slot. We consider a PU traffic model specified in terms of an average duty cycle value, and derive analytical expressions for the false alarm probability (FAP) and correct detection probability (CDP) for any value of K . Our …
A Graph-Based Approach To Boundary Estimation With Mobile Sensors, Sean Onufer Stalley, Dingyu Wang, Gautam Dasarathy, John Lipor
A Graph-Based Approach To Boundary Estimation With Mobile Sensors, Sean Onufer Stalley, Dingyu Wang, Gautam Dasarathy, John Lipor
Electrical and Computer Engineering Faculty Publications and Presentations
We consider the problem of adaptive sampling for boundary estimation, where the goal is to identify the two dimensional spatial extent of a phenomenon of interest. Motivated by applications in estimating the spread of wildfires with a mobile sensor, we present a novel graph-based algorithm that is efficient in both the number of samples taken and the distance traveled. The key idea behind our approach is that by sampling locations close to known cut edges (edges whose vertices lie on opposite sides of the boundary), we can reliably find additional cut edges. Our approach repeats this process of using the …