نتایج جستجو برای: sequential exploration approach1

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

1995
Jun H. Jo John S. Gero

This paper describes a design method based on constructing a genetic/evolutionarydesign model whose idea is borrowed from natural genetics. Two major issues from the modelling involve how to represent design knowledge for the evolutionary design model and the usefulness of the model for design problems. For the representation of design knowledge in the model, a schema concept is introduced. The...

2006
Moody T. Chu Nickolay T. Trendafilov Nickolay Trendafilov

In the present paper the ORTHOMAX rotation problem is reconsidered. It is shown that its solution can be presented as a steepest ascent flow on the manifold of orthogonal matrices. A matrix formulation of the ORTHOMAX problem is given as an initial value problem for matrix differential equation of first order. The solution can be found by any available ODE numerical integrator. Thus the paper p...

Journal: :Quarterly journal of experimental psychology 2007
Tamas Makany Edward S Redhead Itiel E Dror

A total of 41 participants explored a novel square-shaped environment containing five identical boxes each hiding a visually distinct object. After an initial free exploration the participants were required to locate the objects first in a predetermined and subsequently in an optional order task. Two distinct exploration strategies emerged: Participants explored either along the main axes of th...

Journal: :I. J. Robotics Res. 2008
José-Luis Blanco Juan-Antonio Fernández-Madrigal Javier González

Rao–Blackwellized particle filters (RBPFs) are an implementation of sequential Bayesian filtering that has been successfully applied to mobile robot simultaneous localization and mapping (SLAM) and exploration. Measuring the uncertainty of the distribution estimated by a RBPF is required for tasks such as information gain-guided exploration or detecting loop closures in nested loop environments...

2016
Flavio Ferrarotti Loredana Tec José Maria Turull Torres

Starting from Gurevich’s thesis for sequential algorithms (the so-called “sequential ASM thesis”), we propose a characterization of the behaviour of sequential algorithms enriched with reflection. That is, we present a set of postulates which we conjecture capture the fundamental properties of reflective sequential algorithms (RSAs). Then we look at the plausibility of an ASM thesis for the cla...

Journal: :IEICE Transactions 2009
Shuichi Miyazaki Naoyuki Morimoto Yasuo Okabe

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

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