The concurrent structure-control redesign approach is stated as a dynamic optimization problem (DOP).
In this paper a concurrent structure-control redesign approach is proposed in order to find the minimum positioning time of an underactuated robot manipulator, by considering a synergetic combination between the structural parameters and a bang bang control law.
Possible additional topics include functional data structures, concurrent data structures, and spatial data structures.
This article proposes a novel approach to concurrent data structure design where the data structure dynamically adapts its synchronization granularity based on the detected contention and the amount of data that operations are accessing.
This paper proposes a new concurrent data structure, called parallel hash table, for synchronizing the access of multiple threads to resources stored in a shared buffer.
To empirically evaluate the proposed concurrent data structure, we compare the performance of a TCP multi-threaded parallel hash table-based server to a conventional TCP multi-threaded shared buffer-based server implemented in Java.
Subsequent to Givens lattice realization of the front-end MIMO-DFE, we perform a systolic array implementation of multiple adaptive Viterbi detectors [36], thereby a highly concurrent receiver structure is obtained.
We entered child and family selection controls in each model, including child sex and ethnic minority status, and concurrent household structure (single parent vs. two parents), maternal education, family income, and firm/responsive parenting practices.
Concurrent data structures seek to provide similar performance to sequential data structures while being accessible concurrently by several processes and providing synchronization mechanisms transparently to those processes.
With multicores being ubiquitous, concurrent data structures are increasingly important.
He is also interested in parallel algorithms for text analytics, concurrent data structures, and methods for deterministic parallelism.
