50,293 Hits in 3.2 sec


1993 International journal of high speed computing  
Today's massively parallel machines present AI with a golden opportunity to make an impact, especially in the world of commercial applications.  ...  There is now widespread agreement in the supercomputing community that by the year 2000 all supercomputers (defined as the most powerful machines available at a given time) will be massively parallel [  ...  A Brief History of Massively Parallel AI The Connection Machine system was originally designed to handle AI tasks, such as NETL-like marker-passing over semantic networks, and low-level computer vision  ... 
doi:10.1142/s0129053393000207 fatcat:b6ia5afkfrayditwcrckf2f4h4

Fully Automated Design of Super-High-Rise Building Structures by a Hybrid AI Model on a Massively Parallel Machine

Hojjat Adeli, Hyo Seon Park
1996 The AI Magazine  
Articles Fully Automated Design of Super–High-Rise Building Structures by a Hybrid AI Model on a Massively Parallel Machine  ...  Adeli is also the tural Optimization on a Massively Parallel Super- founder and editor in chief of the Integrated Com- computer.  ... 
doi:10.1609/aimag.v17i3.1233 dblp:journals/aim/AdeliP96 fatcat:rl5dbsjvifb77hpruubpvixiuq

A comparative study of single nucleotide variant detection performance using three massively parallel sequencing methods

Linea Christine Trudsø, Jeppe Dyrberg Andersen, Stine Bøttcher Jacobsen, Sofie Lindgren Christiansen, Clàudia Congost-Teixidor, Marie-Louise Kampmann, Niels Morling, Tomohiko Ai
2020 PLoS ONE  
Massively parallel sequencing (MPS) has revolutionised clinical genetics and research within human genetics by enabling the detection of variants in multiple genes in several samples at the same time.  ...  Introduction Massively parallel sequencing (MPS) has revolutionised clinical genetics and the research within human genetics.  ... 
doi:10.1371/journal.pone.0239850 pmid:32986766 fatcat:e24kposnhrbjjm7ncvxshxny6i

Transcriptome profile analysis of flowering molecular processes of early flowering trifoliate orange mutant and the wild-type [Poncirus trifoliata (L.) Raf.] by massively parallel signature sequencing

Jin-Zhi Zhang, Xiao-Yan Ai, Lei-Ming Sun, Dong-Liang Zhang, Wen-Wu Guo, Xiu-Xin Deng, Chun-Gen Hu
2011 BMC Genomics  
Raf.] by massively parallel signature sequencing Abstract Background: After several years in the juvenile phase, trees undergo flowering transition to become mature (florally competent) trees.  ...  parallel signature sequencing (MPSS).  ...  Massively parallel signature sequencing technology (MPSS), like expressed sequence tags (ESTs) and serial analysis of gene expression (SAGE), is a sequence-based method that can be used for transcriptional  ... 
doi:10.1186/1471-2164-12-63 pmid:21281513 pmcid:PMC3041747 fatcat:dc2wtf7nyngqrexovaxwjid2li

Computers and Thought Award : Challenges of Massive Parallelism

Hiroaki Kitano
1993 International Joint Conference on Artificial Intelligence  
parallel AI techniques.  ...  Although the AI community has yet to make a quantum leap, there are attempts to make use of the opportu nities offered by massively parallel computers, such as memory-based reasoning, genetic algorithms  ...  use massively parallel computing models [Waltz, 1990 .  ... 
dblp:conf/ijcai/Kitano93 fatcat:om4ldmkow5buxbjokixwzlnjt4

Editorial Message: Special Issue on Advances in Parallel and Distributed Computing for Fuzzy Systems

Guoqing Xiao, Kenli Li, Maozhen Li, Lipo Wang
2019 International Journal of Fuzzy Systems  
Traditional AI technologies and applications have challenges in processing massive data, large-scale communication, as well as collaborative computing of various algorithms, which thus require heavy use  ...  The objective of this special issue is to bring together parallel and distributed computing and AI communities to present the fuzzy-related applications and solutions to performance issues, and also to  ...  Traditional AI technologies and applications have challenges in processing massive data, large-scale communication, as well as collaborative computing of various algorithms, which thus require heavy use  ... 
doi:10.1007/s40815-019-00721-y fatcat:xjzc6o2xxjghjkukerbkj7uxci

Fast AIS Data Decoding Algorithm for Multi-Core CPU

Xiangkun Zeng, Huaran Yan, Yingjie Xiao, Xiaoming Yang
2019 International Journal of Performability Engineering  
The large amount of AIS message data provides many applications. At the same time, the design of efficient decoding of AIS messages has become a new problem.  ...  Because multi-line message filtering and multi-line message binary transcoding are difficult to perform in parallel, these two steps are performed in serial, while the other steps are run in parallel.  ...  consider the need to decode massive AIS messages in a short time.  ... 
doi:10.23940/ijpe.19.03.p34.10451052 fatcat:aelmybr6mnf5bohtfpfxflyujq

Experiments with Massively Parallel Constraint Solving

Lucas Bordeaux, Youssef Hamadi, Horst Samulowitz
2009 International Joint Conference on Artificial Intelligence  
For AI, and constraint solving in particular, this raises the question of how to scale current solving techniques to massively parallel architectures.  ...  These techniques establish a performance baseline for parallel constraint solving technologies against which more sophisticated parallel algorithms need to compete in the future.  ...  Contributions and Outline of the Paper There exists substantial prior work in parallel AI, e.g., [Waltz, 1993] but little work on massively parallel constraint solving [Jaffar et al., 2004] .  ... 
dblp:conf/ijcai/BordeauxHS09 fatcat:q7hzwwbxszel5fj6jgq3tjfz6a

Inheritance Operations in Massively Parallel Knowledge Representation [chapter]

James Geller
1994 Machine Intelligence and Pattern Recognition  
We present a massively parallel representation of transitive relations, emphasizing the subclass relation, which extends our previous linear tree representation of class hierarchies.  ...  To achieve fast response times for special purpose IS-A reasoners, a few AI researchers have made use of massive parallelism.  ...  A Massively Parallel Encoding We now describe our incremental massively parallel encoding of such graphs.  ... 
doi:10.1016/b978-0-444-81704-4.50011-9 fatcat:2voe6mwbwbbzfom5qoty6bqsdq

Massive parallelism for artificial intelligence (extended abstract)

Luc Steels
1987 Microprocessing and Microprogramming  
attempting to explore massive parallelism for Artificial Intelligence.  ...  At the same time various AI researchers conceived programming languages to program small-scale parallelism.  ... 
doi:10.1016/0165-6074(87)90011-1 fatcat:r7ag2bewcvhajeobqtovwhdcau

Massively parallel factorizations of polynomials with many non-commuting variables

Jean-Christophe Hohl
1997 Theoretical Computer Science  
It allows full use of the massively parallel programmation of the CM200.  ...  We give here an effective massively parallel algorithm allowing factorization of polynomials with non-commuting variables and integer coefficients.  ...  So we have k log, N communications and parallel Euclid's algorithm to do.  ... 
doi:10.1016/s0304-3975(96)00108-9 fatcat:gzhrn2mt4fexzfj3fv5gjkul4i

Page 490 of American Society of Civil Engineers. Collected Journals Vol. 118, Issue CP4 [page]

1992 American Society of Civil Engineers. Collected Journals  
Code designed for serial architectures is often horribly inefficient on massively parallel processors (MPP).  ...  As in Fig. 4, it may well be best to view a matrix as a sequence of column vectors on a vector machine such as the Cray, and to view it as a block matrix on a massively parallel architecture.  ... 

Parallel Optimization of Fiber Bundle Segmentation for Massive Tractography Datasets

Andrea Vazquez, Narciso Lopez-Lopez, Nicole Labra, Miguel Figueroa, Cyril Poupon, Jean-Francois Mangin, Cecilia Hernandez, Pamela Guevara
2019 2019 IEEE 16th International Symposium on Biomedical Imaging (ISBI 2019)  
We implemented a parallel algorithm that improves upon its previous version in both execution time and memory usage.  ...  This enables us to load the entire dataset into memory and process all fibers in parallel, even if dE (ai , bi ) = (ai  ...  PARALLEL OPTIMIZATION OF FIBER BUNDLE SEGMENTATION FOR MASSIVE TRACTOGRAPHY DATASETS  ... 
doi:10.1109/isbi.2019.8759208 dblp:conf/isbi/VazquezLLFPMHG19 fatcat:46zgug3yc5dithw34epr7by7qm

Novel Highly Parallel and Systolic Architectures using Quantum Dot-Based Hardware

Amir Fijany, Benny N. Toomarian, Matthew Spotnitz
2000 Parallel Computing  
VLSI technology has made possible the integration of massive number of components (processors, memory, etc.) into a single chip.  ...  As a result, while the high level of integration has opened the way for massively parallel computation A QCA cell consists of four quantum dots positioned at the corner of a square (Fig. 1 ).  ...  Ai+IAi... A2A1P2,, = F__2,,P2,, where Ai =/2--' ® B2, (® indicates Kronecker Product), B 2, = _ h,-L -f_2,-_ (2) and _-2'-t = Diag{_ 4, }, for j = 0, 1,''' 2 i-1 --1, with _2, = e-_-and L = V'2--f.  ... 
doi:10.1142/9781848160170_0057 fatcat:wqgmwl337bgjbbkbhycz6ss2cy

Mobile Edge Computing and Artificial Intelligence: A Mutually-Beneficial Relationship [article]

Ahmed A. Al-habob, Octavia A. Dobre
2020 arXiv   pre-print
On the other hand, MEC servers are utilized to avail a distributed and parallelized learning framework, namely mobile edge learning.  ...  AI provides revolutionary solutions in nearly every important aspect of the MEC offloading process, such as resource management and scheduling.  ...  The idea of MEL has been introduced, in which MEC servers are utilized to distribute and parallelize the resource-intensive learning process of an AI model.  ... 
arXiv:2005.03100v1 fatcat:zyu2ibxhn5fqhe2wpkfsuhwece
« Previous Showing results 1 — 15 out of 50,293 results