A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequenc...
Esther M. Arkin, Michael A. Bender, Erik D. Demain...
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
We develop two algorithms to manage bid data in flexible, multi-unit double auctions. The first algorithm is a multi-unit extension of the 4-HEAP algorithm, and the second is a ...
Since the inception of genetic algorithmics the identification of computational efficiencies of the simple genetic algorithm (SGA) has been an important goal. In this paper we dist...