Search Results - "Parallel and distributed computation"
-
1
Parallel and Distributed Computation for Dynamical Economic Dispatch
ISSN: 1949-3053, 1949-3061Published: Piscataway IEEE 01.03.2017Published in IEEE transactions on smart grid (01.03.2017)“…This letter introduces a parallel and distributed computation method for dynamical economic dispatch over a cyber-physical system. To achieve a faster economic…”
Get full text
Journal Article -
2
A distributed minimum variance estimator for sensor networks
ISSN: 0733-8716, 1558-0008, 1558-0008Published: New York IEEE 01.05.2008Published in IEEE journal on selected areas in communications (01.05.2008)“…A distributed estimation algorithm for sensor networks is proposed. A noisy time-varying signal is jointly tracked by a network of sensor nodes, in which each…”
Get full text
Journal Article -
3
Fast-Lipschitz optimization with wireless sensor networks applications
ISBN: 9781612848549, 1612848540ISSN: 0018-9286, 1558-2523, 1558-2523Published: New York IEEE 01.10.2011Published in 2011 10th International Conference on Information Processing in Sensor Networks (01.10.2011)“…Motivated by the need for fast computations demanded by wireless sensor networks, the new F-Lipschitz optimization theory is introduced for a novel class of…”
Get full text
Conference Proceeding Journal Article -
4
Fast-Lipschitz Optimization With Wireless Sensor Networks Applications
ISSN: 0018-9286Published: IEEE 01.10.2011Published in IEEE transactions on automatic control (01.10.2011)“…Motivated by the need for fast computations in wireless sensor networks, the new F-Lipschitz optimization theory is introduced for a novel class of…”
Get full text
Journal Article -
5
Minimum Energy coding in CDMA Wireless Sensor Networks
ISSN: 1536-1276, 1558-2248, 1558-2248Published: New York, NY IEEE 01.02.2009Published in IEEE transactions on wireless communications (01.02.2009)“…A theoretical framework is proposed for accurate comparison of minimum energy coding in coded division multiple access (CDMA) wireless sensor networks (WSNs)…”
Get full text
Journal Article -
6
A well-structured framework for analysing petri net extensions
ISSN: 0890-5401, 1090-2651Published: San Diego, CA Elsevier Inc 01.11.2004Published in Information and computation (01.11.2004)“…Transition systems defined from recursive functions IN p → IN p are introduced and named WSNs, or well-structured nets. Such nets sit conveniently between…”
Get full text
Journal Article -
7
Parallelizable PARAFAC decomposition of 3-way tensors
ISSN: 1520-6149Published: IEEE 01.04.2015Published in 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (01.04.2015)“…This paper introduces a new PARAFAC algorithm for a class of third-order tensors. Particularly, the proposed algorithm is based on subspace estimation and…”
Get full text
Conference Proceeding -
8
TOSSIM simulation of wireless sensor network serving as hardware platform for Hopfield neural net configured for max independent set
ISSN: 1877-0509, 1877-0509Published: Elsevier B.V 2011Published in Procedia computer science (2011)“…This paper, the third one in a three-paper sequence, presents the result of TOSSIM simulation of a Hopfield neural network as a static optimizer and configured…”
Get full text
Journal Article -
9
nesC-TinyOS model for parallel and distributed computation of max independent set by Hopfield network on wireless sensor network
ISSN: 1877-0509, 1877-0509Published: Elsevier B.V 2011Published in Procedia computer science (2011)“…This paper, the second one in a three-paper sequence, presents the nesC model of a Hopfield neural network configured for a static optimization problem, the…”
Get full text
Journal Article -
10
Paralelización del Algoritmo Criptográfico GOST Empleando el Paradigma de Memoria Compartida
ISSN: 2145-4086, 2145-4086Published: Fundacion Universitaria Luis Amigo 23.10.2015Published in Lampsakos (23.10.2015)“…El artículo refiere el proceso de paralelización del algoritmo criptográfico GOST. La investigación realizada persigue como objetivo, reducir el tiempo de…”
Get full text
Journal Article -
11
A parallel algorithm for big tensor decomposition using randomly compressed cubes (PARACOMP)
ISSN: 1520-6149Published: IEEE 01.05.2014Published in Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing (1998) (01.05.2014)“…A parallel algorithm for low-rank tensor decomposition that is especially well-suited for big tensors is proposed. The new algorithm is based on parallel…”
Get full text
Conference Proceeding -
12
Fault-Tolerant Edge-Pancyclicity of Möbius Cube MQn
“…As one of the most fundamental networks for parallel and distributed computation, cycle is suitable for developing simple algorithms with low communication…”Published: IEEE 01.12.2018
Get full text
Conference Proceeding -
13
On the design of efficient ATM routing schemes
ISSN: 0304-3975, 1879-2294Published: Elsevier B.V 06.01.2002Published in Theoretical computer science (06.01.2002)“…In this paper we deal with the problem of designing virtual path layouts in ATM networks when the hop-count is given and the load has to be minimized. We first…”
Get full text
Journal Article -
14
Compute Pairwise Manhattan Distance and Pearson Correlation Coefficient of Data Points with GPU
ISBN: 0769536425, 9780769536422Published: IEEE 01.05.2009Published in SNPD 2009 : 10th ACIS International Conference on Software Engineering, Artificial Intelligences, Networking and Parallel Distributed Computing : proceedings : 27-29 May 2009 Daegu, Korea (01.05.2009)“…Graphics processing units (GPUs) are powerful computational devices tailored towards the needs of the 3-D gaming industry for high-performance, real-time…”
Get full text
Conference Proceeding -
15
Partial characterizations of networks supporting shortest path interval labeling schemes
ISSN: 0028-3045, 1097-0037Published: New York Wiley Subscription Services, Inc., A Wiley Company 01.09.1998Published in Networks (01.09.1998)“…In this paper, we consider the problem of shortest path interval routing, a space‐efficient strategy for routing in distributed networks. In this scheme, an…”
Get full text
Journal Article -
16
Implementing communicating processes in the event of interface difference
ISBN: 076951071X, 9780769510712Published: IEEE 2001Published in 2nd International Conference on Application of Concurrency to System Design, 2001, Newcastle upon Tyne, UK (2001)“…We present here an implementation relation which formalises the notion that a system built of communicating processes is an acceptable implementation of…”
Get full text
Conference Proceeding -
17
Peer-to-peer estimation over wireless sensor networks via Lipschitz optimization
ISBN: 1424451086, 9781424451081Published: Washington, DC, USA IEEE Computer Society 13.04.2009Published in 2009 International Conference on Information Processing in Sensor Networks (13.04.2009)“…Motivated by a peer-to-peer estimation algorithm in which adaptive weights are optimized to minimize the estimation error variance, we formulate and solve a…”
Get full text
Conference Proceeding -
18
Evolution strategies for engineering design optimisation
ISBN: 0080440460, 9780080440460Published: Elsevier Ltd 2003Published in Computational Fluid and Solid Mechanics 2003 (2003)“…Computer simulations of complex engineering problems have become a standard tool of modern product development and design. The increasing computational power…”
Get full text
Book Chapter -
19
A neural network approach for a robot task sequencing problem
ISSN: 0954-1810Published: Elsevier Ltd 01.04.2000Published in Artificial intelligence in engineering (01.04.2000)“…This paper presents a neural network approach with successful implementation for the robot task-sequencing problem. The problem addresses the sequencing of…”
Get full text
Journal Article

