Search alternatives:
complement could » competent court (Expand Search)
level scheduling » self scheduling (Expand Search)
could algorithm » mould algorithm (Expand Search), carlo algorithm (Expand Search), colony algorithm (Expand Search)
g algorithm » _ algorithms (Expand Search), rd algorithm (Expand Search)
element g » elements _ (Expand Search), clement k (Expand Search)
complement could » competent court (Expand Search)
level scheduling » self scheduling (Expand Search)
could algorithm » mould algorithm (Expand Search), carlo algorithm (Expand Search), colony algorithm (Expand Search)
g algorithm » _ algorithms (Expand Search), rd algorithm (Expand Search)
element g » elements _ (Expand Search), clement k (Expand Search)
-
21
Spectrum Sensing Algorithms for Cooperative Cognitive Radio Networks
Published 2010Get full text
doctoralThesis -
22
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002“…Given a graph G = (V, E), a clique is a complete subgraph in G. …”
Get full text
Get full text
article -
23
-
24
Brain Source Localization in the Presence of Leadfield Perturbations
Published 2015Get full text
doctoralThesis -
25
A Graph Heuristic Approach for the Data Path Allocation Problem
Published 2022“…The algorithm starts with a schedule as input and partitions it into available hardware resources using a modifi ed version of the Fiduccia-Mattheyses algorithm to t the datapath allocation problem. …”
Get full text
Get full text
Get full text
masterThesis -
26
Assessment of static pile design methods and non-linear analysis of pile driving
Published 2006“…The pile/soil interaction system is described by a mass/spring/dashpot system where the properties of each component are derived from rigorous analytical solutions or finite element analysis. The outcome of this research is an algorithm that can be used to predict pile displacement and driving stresses. …”
Get full text
Get full text
Get full text
masterThesis -
27
Spatially-Distributed Missions With Heterogeneous Multi-Robot Teams
Published 2021“…Both combine a generic MILP solver and a genetic algorithm, resulting in efficient anytime algorithms. …”
-
28
Autonomous Demand-Side Management in the Future Smart Grid
Published 2016Get full text
doctoralThesis -
29
Peak Loads Shaving in a Team of Cooperating Smart Buildings Powered Solar PV-Based Microgrids
Published 2021“…<p>This paper presents a scheduling framework based algorithm for reducing/shaving the peak loads in a team of cooperating microgrids (TCM) powered smart buildings taking advantages of vehicle-to-building (V2B) concept and operational flexibilities of electric vehicles (EVs). …”
-
30
-
31
A hybrid approach for XML similarity
Published 2007“…Owing to an unparalleled increasing use of the XML standard, developing efficient techniques for comparing XML-based documents becomes essential in information retrieval (IR) research. Various algorithms for comparing hierarchically structured data, e.g. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
32
-
33
Mobile Energy Storage Systems for Benefit Maximization in Resilient Smart Grids
Published 2025Get full text
doctoralThesis -
34
An integrated partitioning and synthesis system for dynamically reconfigurable Multi-FPGA architectures
Published 2017“…The SPARCS system accepts design specifications at the behavior level, in the form of task graphs. The system contains a temporal partitioning tool to temporally divide and schedule the tasks on the reconfigurable architecture, a spatial partitioning tool to map the tasks to individual FPGAs, and a high-level synthesis tool to synthesize efficient register-transfer level designs for each set of tasks destined to be downloaded on each FPGA. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
35
-
36
Big Data Energy Management, Analytics and Visualization for Residential Areas
Published 2020“…This serves as a nudge in consumer's behavior to schedule their home appliances operation according to their local community consumption profile and trend. …”
Get full text
article -
37
Approximate XML structure validation based on document–grammar tree similarity
Published 2015“…In this paper, we propose an original method for measuring the structural similarity between an XML document and an XML grammar (DTD or XSD), considering their most common operators that designate constraints on the existence, repeatability and alternativeness of XML elements/attributes (e.g., ?, ∗, MinOccurs, MaxOccurs, etc.). …”
Get full text
Get full text
Get full text
Get full text
article -
38
-
39
Approximate XML structure validation technical report
Published 2014“…In this paper, we propose an original method for measuring the structural similarity between an XML document and an XML grammar (DTD or XSD), considering their most common operators that designate constraints on the existence, repeatability and alternativeness of XML elements/attributes (e.g., ?, *, MinOccurs, MaxOccurs, etc.). …”
Get full text
Get full text
Get full text
article