Navigating Knowledge: Effects of State Curiosity on Children's Word Learning and Information Seeking
Developmental Science, Volume 29, Issue 4, July 2026.ABSTRACT Early learning takes place within complex, multimodal environments where curiosity plays a critical role in guiding exploratory behaviors and supporting cognitive development. While trait curiosity shapes children's early learning experiences, state curiosity is context‐dependent fostering early learning, in‐part, through information seeking ...
Anna Caunt +3 more
wiley +1 more source
Iterative Patching and the Asymmetric Traveling Salesman Problem [PDF]
Although Branch and Bound (BnB) methods are among the most widely used techniques for solving hard problems, it is still a challenge to make these methods smarter.
Goldengorin, Boris +3 more
core
On the Core of Multiple Longest Traveling Salesman Games [PDF]
In this paper we introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in which a salesman has to visit each node (player) precisely once, except its home location, in an order that maximizes the total reward ...
Borm, P.E.M. +2 more
core
Finding optimal solutions to Traveling Salesman Problem by using Branch and Bound method and one of intelligence techniques with application [PDF]
المجلة العراقية للعلوم الاحصائية, 2013 In this research we find an optimal solutions for traveling salesman problem (TSP) using Branch and Bound method as well as we use an intelligence techniques represented by ant colony optimization (ACO) and applied them on the DNA chain data, where the ...
doaj +1 more source
Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP). [PDF]
PeerJ Comput Sci, 2023 Hao T, Yingnian W, Jiaxing Z, Jing Z.
europepmc +1 more source
The 2-period balanced traveling salesman problem [PDF]
In the 2-period Balanced Traveling Salesman Problem (2B-TSP), the customers must be visited over a period of two days: some must be visited daily, and the others on alternate days (even or odd days); moreover, the number of customers visited in every ...
Francesco Mason, Tatiana Bassetto
core
Evolutionary computation applied to combinatorial optimisation problems [PDF]
, 2007 This thesis addresses the issues associated with conventional genetic algorithms (GA) when applied to hard optimisation problems. In particular it examines the problem of selecting and implementing appropriate genetic operators in order to meet the ...
Mitchell, George G.
core +2 more sources
Revista Produção Online, 2013 The Clustered Traveling Salesman Problem (CTSP) is a generalization of the Traveling Salesman Problem (TSP) in which the set of vertices is partitioned into disjoint clusters and objective is to find a minimum cost Hamiltonian cycle such that the ...
Mário Mestria
doaj +1 more source
A Comparison of Algorithms for Finding an Efficient Theme Park Tour
Journal of Applied Mathematics, 2018 The problem of efficiently touring a theme park so as to minimize the amount of time spent in queues is an instance of the Traveling Salesman Problem with Time-Dependent Service Times (TSP-TS). In this paper, we present a mixed-integer linear programming
Elizabeth L. Bouzarth +6 more
doaj +1 more source
Genetiniai algoritmai komivojažieriaus uždaviniui: negatyvieji ir pozityvieji aspektai*
Informacijos Mokslai, 2009 Šiame straipsnyje nagrinėjami klausimai, susiję su genetinių algoritmų taikymu, sprendžiant gerai žinomą kombinatorinio optimizavimo uždavinį – komivojažieriaus uždavinį (KU) (angl. traveling salesman problem).
Alfonsas Misevičius +3 more
doaj +1 more source