The design space exploration (DSE) subsystem of a design automation tool is responsible for early identification of interesting zones of the design space. Evaluation of the exploration strategy used in a tool is extremely difficult because there is not enough information about either the design space or the actual cost function. This paper describes a software environment for quantitative evalu...

Modern digital systems design requires us to explore a large and complex design space to find a best configuration which satisfies design requirements. Such exploration requires a sound representation of design space from which design candidates are efficiently generated, each of which then is evaluated. This paper proposes a plan-generationevaluation framework which supports a complete process...

Habituation is a common form of non-associative learning in which the organism gradually decreases its response to repeated stimuli. The decrease in exploratory activity of many animal species during exposure to a novel open field arena is a widely studied habituation paradigm. However, a theoretical framework to quantify how the novelty of the arena is learned during habituation is currently m...

We present an on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon. We prove that the resulting tour is less than 26.5 times as long as the shortest watchman tour that could be computed off-line. Our analysis is doubly founded on a novel geometric structure called the angle hull. Let D be a connected region inside a simple polygon, P . We define the angl...

Communication design for SoCs poses the unique challenges in order to cover a wide range of architectures while offering new opportunities for optimizations based on the application specific nature of system designs. In this report, we propose automatic generation of communication architecture from communication link model where system components communicate through logical links of network arc...

| This paper describes an exact solution methodology, implemented in Rensselaer's Voyager design space exploration system, for solving the scheduling problem in a 3dimensional (3D) design space: the usual 2D design space (which trades o area and schedule length), plus a third dimension representing clock length. Unlike design space exploration methodologies which rely on bounds or estimates, th...

In the map veriication problem, a robot is given a (possibly incorrect) map M of the world G with its position and orientation indicated on the map. The task is to nd out whether this map, for the given robot position and its orientation in the map, is correct for the world G. We consider the world model of a graph G = (V G ; E G) in which, for each vertex, edges incident to the vertex are orde...

In this paper we propose an original and fast design space exploration method targeting reconfigurable architectures. This method takes place during the first steps of a design flow that works at the algorithmic level. It uses as input a high level specification of the application and is based on a functional model to describe the architectures to compare. This paper describes the projection st...

As design problems become more complex and design lead time more pressing, designers need effective support tools to expand their design space exploration. In this paper, a hierarchical coevolutionary approach is proposed to support designers by automatically generating design concepts based on the designers’ inputs. The approach adopts a zigzag design process in which function structures and t...

We investigate the exploration problem of a short-sighted mobile robot moving about in an unknown cellular room. In order to explore a cell, the robot must enter it. Once inside, the robot knows which of the 4 adjacent cells exist and which are boundary edges. The robot starts from a specified cell adjacent to the room’s outer wall; it visits each cell, and returns to the start. Our interest is...