scholarly journals A fast spectral divide‐and‐conquer method for banded matrices

2021 ◽  
Author(s):  
Ana Šušnjara ◽  
Daniel Kressner
Keyword(s):  
Divide And Conquer ◽  
Banded Matrices

scholarly journals An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths

2016 ◽  
Vol 71 (10) ◽  
pp. 1933-1943 ◽  
Author(s):  
Xiangke Liao ◽  
Shengguo Li ◽  
Lizhi Cheng ◽  
Ming Gu
Keyword(s):  
Divide And Conquer ◽  
Divide And Conquer Algorithm ◽  
Banded Matrices

Scaffold Safety Analysis: Focusing on Divide-and-Conquer Method

2020 ◽  
Author(s):  
Sayan Sakhakarmi ◽  
Chunhee Cho ◽  
JeeWoong Park
Keyword(s):  
Safety Analysis ◽  
Divide And Conquer

Preimage Attacks on Reduced Troika with Divide-and-Conquer Methods

2020 ◽  
Vol E103.A (11) ◽  
pp. 1260-1273
Author(s):  
Fukang LIU ◽  
Takanori ISOBE
Keyword(s):  
Divide And Conquer

Simultaneous Localization and Sampled Environment Mapping Based on a Divide-and-conquer Ideology

2011 ◽  
Vol 36 (12) ◽  
pp. 1697-1705 ◽  
Author(s):  
Rong-Chuan SUN ◽  
Shu-Gen MA ◽  
Bin LI ◽  
Ming-Hui WANG ◽  
Yue-Chao WANG
Keyword(s):  
Divide And Conquer

A Divide-and-Conquer Approach for Language Identification Based on Recurrent Neural Networks

2016 ◽  
Author(s):  
G. Gelly ◽  
Jean-Luc Gauvain ◽  
V.B. Le ◽  
A. Messaoudi
Keyword(s):  
Neural Networks ◽  
Recurrent Neural Networks ◽  
Language Identification ◽  
Divide And Conquer

A Divide-and-Conquer Strategy for the Prediction of Protein Contact Map

2014 ◽  
Vol 12 (2) ◽  
pp. 124-130 ◽  
Author(s):  
Cosme Santiesteban-Toca ◽  
Gerardo Casanola-Martin ◽  
Jesus Aguilar-Ruiz
Keyword(s):  
Divide And Conquer ◽  
Contact Map

Algorithmic Puzzles

2011 ◽  
Author(s):  
Anany Levitin ◽  
Maria Levitin
Keyword(s):  
Problem Solving ◽  
Computer Science ◽  
Algorithm Design ◽  
Divide And Conquer ◽  
Algorithmic Problem ◽  
Design Strategies ◽  
Job Interviews ◽  
Skill Levels ◽  
Problem Solving Skills ◽  
Solution Methods

While many think of algorithms as specific to computer science, at its core algorithmic thinking is defined by the use of analytical logic to solve problems. This logic extends far beyond the realm of computer science and into the wide and entertaining world of puzzles. In Algorithmic Puzzles, Anany and Maria Levitin use many classic brainteasers as well as newer examples from job interviews with major corporations to show readers how to apply analytical thinking to solve puzzles requiring well-defined procedures. The book's unique collection of puzzles is supplemented with carefully developed tutorials on algorithm design strategies and analysis techniques intended to walk the reader step-by-step through the various approaches to algorithmic problem solving. Mastery of these strategies--exhaustive search, backtracking, and divide-and-conquer, among others--will aid the reader in solving not only the puzzles contained in this book, but also others encountered in interviews, puzzle collections, and throughout everyday life. Each of the 150 puzzles contains hints and solutions, along with commentary on the puzzle's origins and solution methods. The only book of its kind, Algorithmic Puzzles houses puzzles for all skill levels. Readers with only middle school mathematics will develop their algorithmic problem-solving skills through puzzles at the elementary level, while seasoned puzzle solvers will enjoy the challenge of thinking through more difficult puzzles.

Effects of Multi-Core Processors on Sequential Divide and Conquer Algorithms

2021 ◽  
Author(s):  
Fahd A. Alhaidari ◽  
Maissa A. Al Metrik
Keyword(s):  
Divide And Conquer
Sign in / Sign up

Export Citation Format

Share Document