We investigate a route exploration problem with N agents dropped randomly on the interval [0,b] and discuss the impact of using multiple agents to perform this task. We consider both a discrete and a continous description of the path to explore. Independantly, we study an exploration problem with probabilistic agents having limited autonomy. In both problems , multi-agent scenarios are discusse...

Exchanging gazes with a social partner in response to an event in the environment is considered an effective means to direct attention, share affective experiences, and highlight a target in the environment. This behavior appears during infancy and plays an important role in children's learning and in shaping their socio-emotional development. It has been suggested that cultural values of the c...

This work presents further enhancements to an environment for exploring coarse grained reconfigurable data-driven array architectures suitable to implement data-stream applications. The environment takes advantage of Java and XML technologies to enable architectural trade-off analysis. The flexibility of the approach to accommodate different topologies and interconnection patterns is shown by a...

This research enables robot explorers to maximize the total information gained while minimizing costs such as driving, sensing and planning. This paper presents a general methodology for solving complex exploration tasks which employs multiple sources of information. The paper also develops a specific instantiation of the method to solve the exploration problem of creating a complete traversabi...

Theoretical models of social learning predict that individuals can benefit from using strategies that specify when and whom to copy. Here the interaction of two social learning strategies, model age-based biased copying and copy when uncertain, was investigated. Uncertainty was created via a systematic manipulation of demonstration efficacy (completeness) and efficiency (causal relevance of som...

In this paper, we present a unified estimation technique to find the lower bounds on the number of LUT blocks and that of the micro-registers which can be obtained by any partitioning or synthesis methods, respectively, without performing any actual synthesis and/or design space exploration. The lower bound estimation is very important in sense that it greatly helps to evaluate the results of t...

This study illustrates the application of conditional simulations to calculate uncertainty associated with thickness bauxite ores. The deposit Rondon do Pará in northern State, Brazil, is characterized by a well-defined lateritic profile, ore being composed two sequential horizons: massive and ferruginous bauxite. used data from 1.005 drillholes different grid spacing. Drillhole intervals both ...

We present a framework that maps the four data-driven strategies—Minimize Costs, Reward Loyalty, Personalize Interactions, and Acquire Customers—that a firm can enact to extract value from its customer data. The four strategies are distinguished by the potential repurchase frequency and the customizability of a firm’s products or services. We describe each of the strategies and provide in-depth...

Contracts provide a precise way of specifying object-oriented systems. When a class structure is modified, the corresponding contracts must be modified accordingly. This paper presents a method of transforming contracts, which allows the extension of a mapping defined on a few model elements, to what we call an interpretation function, and to use this function to automatically translate OCL-con...

In many practical situations the outputs of a plant are not measured exactly, but are corrupted by quantization errors. Often the effect of the quantization error is neglected in the control design phase, which can lead to undesirable effects like limit cycles and even chaotic behavior once the controller has been implemented. In this paper we present a method based on 11 optimal control that m...