The availability of low-cost computational power is enabling the development of increasingly sophisticated CAD software. Automation of design and manufacturing activities poses many difficult computational problems-significant among them is how to develop interactive systems that enable designers to explore and experiment with alternative ideas. As more downstream manufacturing activities are c...

Many machine learning systems are built to solve the hardest examples of a particular task, which often makes them large and expensive to run—especially with respect to the easier examples, which might require much less computation. For an agent with a limited computational budget, this “one-size-fits-all” approach may result in the agent wasting valuable computation on easy examples, while not...

Aiming at the problem of single stitching scenes (ordered or disordered images), which are time-consuming and involve complex computation during image stitching, a multi-scene method based on merge sorting is proposed called merge-sorting (MSIS). We established an model sorting, directly matched images without traversing all them. Compared with traditional method, this significantly reduces com...

Current traditional models of parallel computing rely on the static breaking-up of computation or data: multiple parallel threads independently execute different parts of the overall computation with little or no communication between them. Under current models, inter-thread communication is limited to data that carries little semantic information about the role of the thread in the overall app...

Determining a feasible bending sequence, i.e., ensuring absence of wire self-collisions and wire-machine collisions, or even an optimal minimising time energy required to perform it, is difficult time-consuming task for complex workpieces, expert operators. Introducting algorithms the computation wire-bending sequences thus crucial increase productivity production flexibility, decrease costs. T...

We present research on task markets where automated planning procedures are used to enlist computational and human expertise to jointly contribute to the solution of problems, based on a consideration of the competencies, availabilities, and pricing of the different problem-solving resources. The methods meld the area of human computation with automated reasoning. We describe a prototype that c...

We propose an efficient protocol for secure comparison of integers when both integers are shared between two parties. Such protocols are useful for implementing secure auctions. The proposed protocol’s computational complexity is roughly half the complexity of the best known efficient protocol. The efficiency of the proposed protocol stems from the removal of the XOR computation which is a time...