11,640 research outputs found
Prototype system for supporting the incremental modelling of vague geometric configurations
In this paper the need for Intelligent Computer Aided Design (Int.CAD) to jointly support design and learning assistance is introduced. The paper focuses on presenting and exploring the possibility of realizing learning assistance in Int.CAD by introducing a new concept called Shared Learning. Shared Learning is proposed to empower CAD tools with more useful learning capabilities than that currently available and thereby provide a stronger interaction of learning between a designer and a computer. Controlled computational learning is proposed as a means whereby the Shared Learning concept can be realized. The viability of this new concept is explored by using a system called PERSPECT. PERSPECT is a preliminary numerical design tool aimed at supporting the effective utilization of numerical experiential knowledge in design. After a detailed discussion of PERSPECT's numerical design support, the paper presents the results of an evaluation that focuses on PERSPECT's implementation of controlled computational learning and ability to support a designer's need to learn. The paper then discusses PERSPECT's potential as a tool for supporting the Shared Learning concept by explaining how a designer and PERSPECT can jointly learn. There is still much work to be done before the full potential of Shared Learning can be realized. However, the authors do believe that the concept of Shared Learning may hold the key to truly empowering learning in Int.CAD
Partial Strategyproofness: Relaxing Strategyproofness for the Random Assignment Problem
We present partial strategyproofness, a new, relaxed notion of
strategyproofness for studying the incentive properties of non-strategyproof
assignment mechanisms. Informally, a mechanism is partially strategyproof if it
makes truthful reporting a dominant strategy for those agents whose preference
intensities differ sufficiently between any two objects. We demonstrate that
partial strategyproofness is axiomatically motivated and yields a parametric
measure for "how strategyproof" an assignment mechanism is. We apply this new
concept to derive novel insights about the incentive properties of the
probabilistic serial mechanism and different variants of the Boston mechanism.Comment: Working Pape
Engineering a Conformant Probabilistic Planner
We present a partial-order, conformant, probabilistic planner, Probapop which
competed in the blind track of the Probabilistic Planning Competition in IPC-4.
We explain how we adapt distance based heuristics for use with probabilistic
domains. Probapop also incorporates heuristics based on probability of success.
We explain the successes and difficulties encountered during the design and
implementation of Probapop
Sequential Randomized Algorithms for Convex Optimization in the Presence of Uncertainty
In this paper, we propose new sequential randomized algorithms for convex
optimization problems in the presence of uncertainty. A rigorous analysis of
the theoretical properties of the solutions obtained by these algorithms, for
full constraint satisfaction and partial constraint satisfaction, respectively,
is given. The proposed methods allow to enlarge the applicability of the
existing randomized methods to real-world applications involving a large number
of design variables. Since the proposed approach does not provide a priori
bounds on the sample complexity, extensive numerical simulations, dealing with
an application to hard-disk drive servo design, are provided. These simulations
testify the goodness of the proposed solution.Comment: 18 pages, Submitted for publication to IEEE Transactions on Automatic
Contro
- …