18,870 Hits in 4.2 sec

Page 1328 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
A stochastic divide-and-conquer algorithm is a divide-and-conquer algorithm with a stochastic component within the algorithm itself.  ...  We argue that the divide-and-conquer paradigm fits naturally into the BSP model, without any need for subset synchronization.  ... 

Author index volume 5 (1985)

1985 Science of Computer Programming  
., Algebraic specification and verification of communication protocols ( 1 ) Martin, A.J., Distributed mutual exclusion on a ring of processes (3) Meyer, B., J.-M. Nerson and S.H.  ...  Meyer (2) Paulson, L.C., Verifying the unification algorithm in LCF , D.R., The design of divide and conquer algorithms (1) Souqui~res, J., see J.-P. Finance (2) Souqui~res, J. and J.-P.  ... 
doi:10.1016/0167-6423(85)90021-8 fatcat:tabwnxhwyncmnlvfogamebppoq

Partitioning Strategy Divide and Conquer as CPANs. A Methodological Proposal

Mario Rossainz López, Manuel I. Capel Tuñón, Diego Sarmiento Rojas
2017 Research in Computing Science  
Synchronization policies are expressed in terms of restrictions; for instance, mutual exclusion in reader/writer processes or the maximum parallelism allowed for writer processes.  ...  With the strategy divide and conquer as CPAN the parallel processing technique called n-Tree is used to parallelize sequential code that solve classic problems that can be partitioned by divide and conquer  ...  Synchronization policies are expressed in terms of restrictions; for instance, mutual exclusion in reader/writer processes or the maximum parallelism allowed for writer processes.  ... 
doi:10.13053/rcs-145-1-2 fatcat:ght2zbz5tbhz7obd33h6y2svpq

Divide-and-Conquer Parallelism for Learning Mixture Models [chapter]

Takaya Kawakatsu, Akira Kinoshita, Atsuhiro Takasu, Jun Adachi
2016 Lecture Notes in Computer Science  
In this paper, we propose a recursive divide-and-conquer-based parallelization method for high-speed machine learning.  ...  Some approaches to the race condition problem, such as mutual exclusion and atomic operations, degrade the memory access performance.  ...  Furthermore, the divide-and-conquer algorithm derives parameters without requiring mutual exclusion or atomic operations with shared variables by using a buffering solution that avoids the bottleneck of  ... 
doi:10.1007/978-3-662-53455-7_2 fatcat:fk6pjv3u6vf6pdm4jtb6eb66bq

Weight Divergence Driven Divide-and-Conquer Approach for Optimal Federated Learning from non-IID Data [article]

Pravin Chandran, Raghavendra Bhat, Avinash Chakravarthi, Srikanth Chandar
2021 arXiv   pre-print
deep layers for performing a Divide and Conquer training.  ...  Addressing the ability to handle data heterogeneity (non-identical and independent distribution or non-IID) is a key enabler for the wider deployment of Federated Learning.  ...  The two parts of the global model are trained in a mutually exclusive manner while freezing the other part.  ... 
arXiv:2106.14503v2 fatcat:hnzd2oy6jzbz7mh73c6tltooka

Recursion-driven parallel code generation for multi-core platforms

Rebecca L Collins, Bharadwaj Vellore, Luca P Carloni
2010 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)  
We present Huckleberry, a tool for automatically generating parallel implementations for multi-core platforms from sequential recursive divide-and-conquer programs.  ...  distribution and inter-core synchronization mechanisms.  ...  The authors thank Georgia Institute of Technology, its Sony-Toshiba-IBM Center of Competence, and the NSF, for access to their Cell Broadband Engine resources.  ... 
doi:10.1109/date.2010.5457214 dblp:conf/date/CollinsVC10 fatcat:oft4zsx27ngcpfus5o26f5dqgy

A combinatorial analysis of subcube reliability in hypercubes

Y. Chang, L.N. Bhuyan
1995 IEEE transactions on computers  
In this brief contribution, we derive an exact expression for (n -1)-cube reliability in an n-cube using a new probability fault model and M existing random fault model.  ...  Approximate results are also obtained for m-cube reliability for values of m smaller than n -I.  ...  We use a divide-and-conquer technique to compute R.,,@). The n-cube is divided into two (n -1)-cubes, Q,, and along dimension i.  ... 
doi:10.1109/12.392856 fatcat:xb5elwtdirgyfhnqmblbhlffhq

Divide and Conquer

Eric A. Posner, Kathryn E. Spier, Adrian Vermeule
2010 Journal of Legal Analysis  
An employer, for example, may preempt the formation of a labor union by inducing or coercing groups of workers not to participate.  ...  The key idea is that the unitary actor can create and exploit divisions between the game's players, making them collectively worse off.  ...  for the explicit design of divide and conquer mechanisms.  ... 
doi:10.1093/jla/2.2.417 fatcat:cqt4c4saevh6zcnekvazthan7q

Divide and Conquer [chapter]

Shashi Shekhar, Hui Xiong
2008 Encyclopedia of GIS  
Conditions under which divide and conquer strategies reduce or enhance social welfare, and techniques that policy makers can use to combat divide and conquer tactics, are also discussed.  ...  The maxim "divide and conquer" (divide et impera) is invoked frequently in law, history, and politics, but often in a loose or undertheorized way.  ...  It is that the United States will not be subject to institutions set up to foreclose divide-and-conquer tactics in particular issue areas-for example, in the distribution of sea resources under the Law  ... 
doi:10.1007/978-0-387-35973-1_321 fatcat:56pcl57bnbbfldxecstsyer7gm

Learning decision tree classifiers

J. R. Quinlan
1996 ACM Computing Surveys  
These cause the divide-and-conquer algorithm to generate elaborate trees that attempt to model the discrepancies.  ...  Classes here are mutually exclusive labels such as medical diagnoses, qualitative economic projections, image categories, or failure modes.  ... 
doi:10.1145/234313.234346 fatcat:dtn4imndrjdaleej7g6ymte7ci

A Divide & Conquer Approach to Leads-to Model Checking

Yati Phyo, Canh Minh Do, Kazuhiro Ogata
2021 Computer journal  
The technique divides an original leads-to model checking problem into multiple smaller model checking problems and tackles each smaller one.  ...  The technique is called a divide & conquer approach to leads-to model checking. As indicated by the name, the technique is dedicated to leads-to properties.  ...  Funding Japan Society for the Promotion of Science (JSPS), Grant-in-Aid for Scientific Research (B) (grant no. JP19H04082).  ... 
doi:10.1093/comjnl/bxaa183 fatcat:vpj2yicdjrggtfhr25fjk5lshq

Towards Architecture-Adaptable Parallel Programming

Santhosh Kumaran, Michael J. Quinn
1997 Scientific Programming  
procedural programming languages in two ways: (1) our system automatically selects the appropriate parallel algorithm to solve the given problem efficiently on the specified architecture; (2) by using a divide-and-conquer  ...  The primary reasons for this crisis are the short life span and small installation base of parallel architectures.  ...  I am grateful to my parents for teaching me to dream and to work hard to make those dreams come true. This work was supported by NSF grant ASC-9208971.  ... 
doi:10.1155/1997/586912 fatcat:2el6aq4kwjb2zlwh42mty7wj6u

Divide and conquer

Ulrich Scholz, Romain Rouvoy
2007 Ninth international workshop on Principles of software evolution in conjunction with the 6th ESEC/FSE joint meeting - IWPSE '07  
In this paper, we introduce a divide and conquer approach for the adaptation of distributed applications management by a potentially large number of interacting middleware instances.  ...  The partitioning is found by symbolic reasoning and by applying expert knowledge that is encoded in explicit rules.  ...  The work is funded by the Klaus Tschira Foundation and by the European Commission under the contract number 035166 for the MUSIC project.  ... 
doi:10.1145/1294948.1294958 dblp:conf/sigsoft/ScholzR07 fatcat:s3izazvzgzeddp2egpaogkmnoi

A Non-Token-Based-Distributed Mutual Exclusion Algorithm for Single-Hop Mobile Ad Hoc Networks [chapter]

Romain Mellier, Jean-Frederic Myoupo, Vlady Ravelomanana
2005 IFIP International Federation for Information Processing  
This paper presents a simple mutual exclusion algorithm for ad hoc mobile networks. Our algorithm does not use the token circulation technique.  ...  With the help of the probabilistic divide-and-conquer technique, we derive a single hop protocol which requires n / In 2 broadcast rounds in average case.  ...  Related Works Intuitively, one can believe that a mutual exclusion algorithm for ad hoc networks can be obtained by a simple adaptation of a mutual exclusion algorithm for wired networks.  ... 
doi:10.1007/0-387-23150-1_25 fatcat:7xbpfzrlqjfgzabw2xec2w446e

A Divide-and-conquer Evolutionary Algorithm for Large-scale Virtual Network Embedding

An Song, Wei-Neng Chen, Yue-Jiao Gong, Xiaonan Luo, Jun Zhang
2019 IEEE Transactions on Evolutionary Computation  
In this article, we intend to propose a divide-and-conquer evolutionary algorithm with overlapping decomposition (ODEA) to solve large-scale VNE problems.  ...  His current research interests include evolutionary computation algorithms and their applications on large scale computing, virtual network embedding, and workflow scheduling.  ...  The classical divide-and-conquer strategy in many evolutionary algorithms decomposes a large problem into mutually exclusive subcomponents and each subcomponent is optimized independently, such as differential  ... 
doi:10.1109/tevc.2019.2941824 fatcat:vmmptreyqjcbvjrjhdxvk2v4ka
« Previous Showing results 1 — 15 out of 18,870 results