نتایج جستجو برای: Problem solving puzzles

تعداد نتایج: 936167  

پایان نامه :دانشگاه تربیت معلم - تهران - دانشکده روانشناسی و علوم تربیتی 1391

the purpose of this study was the relationship between problem – solvi ability with fdi cognitive style of students.the research method was correlation method. for data analysis pearson test was used. statistical society in this research was all the students of alligoodarz city in 1391-92 year.to sampling of statiscal population was used sampling multi-stage random the size of sample selected 2...

2017
Anany Levitin

The paper concerns an important but underappreciated genre of algorithmic puzzles, explaining what these puzzles are, reviewing milestones in their long history, and giving two different ways to classify them. Also covered are major applications of algorithmic puzzles in cognitive science research, with an emphasis on insight problem solving, and the advantages of algorithmic puzzles over some ...

Elham Raji Lahiji Ramin Rahmany,

This study tried to investigate the impact of using problem-solving puzzles onIranian Intermediate EFL learners' lexical knowledge. At first a homogenoussample of 30 Intermediate EFL learners attending in the third grade of Shahedhigh school in Lahijan were selected and they were randomly divided into twogroups, as experimental group and control group. In the first session, the pretestwas admin...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت دبیر شهید رجایی - دانشکده ادبیات و زبانهای خارجی 1392

abstract the current study examined the role of emotional intelligence and motivation on language learning of efl learners in iranian context. the participants of this study were 162 female and 100 male junior high school students. these participants were selected by convenient sampling method. to carry out the study two questionnaires were administered to the participants. first, the adap...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

Journal: :Pattern Recognition 2021

This paper focuses on the re-assembly of an archaeological artifact, given images its fragments. problem can be considered as a special challenging case puzzle solving. The restricted natural image from square pieces has been investigated extensively and was shown to difficult in own right. Likewise, matching “clean” 2D polygons/splines based solely their geometric properties studied. But what ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت دبیر شهید رجایی - دانشکده علوم انسانی 1392

the main purpose of the present study was to investigate the relationship between listening proficiency and metacognitive listening strategies awareness among low, mid, and highly self-regulated students. three hundred and seventy one efl students participated in this study (all grade 3 and 4 high-school students who were studying in khansar in academic year 1391-92). to gather the data, three ...

2006
Timo Mantere Janne Koljonen

This paper discusses solving and generating Sudoku puzzles with evolutionary algorithms. Sudoku is a Japanese number puzzle game that has become a worldwide phenomenon. As an optimization problem Sudoku belongs to the group of combinatorial problems, but it is also a constraint satisfaction problem. The objective of this paper is to test if genetic algorithm optimization is an efficient method ...

Journal: :CoRR 2012
Eric C. Chi Kenneth Lange

Solving Sudoku puzzles is one of the most popular pastimes in the world. Puzzles range in difficulty from easy to very challenging; the hardest puzzles tend to have the most empty cells. The current paper explains and compares three algorithms for solving Sudoku puzzles. Backtracking, simulated annealing, and alternating projections are generic methods for attacking combinatorial optimization p...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید