Sciweavers

5244 search results - page 13 / 1049
» When are two algorithms the same
Sort
View
IPL
1998
177views more  IPL 1998»
13 years 7 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
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...
JaeCheol Ha, Sang-Jae Moon
WADS
2001
Springer
63views Algorithms» more  WADS 2001»
14 years 1 days ago
When Can You Fold a Map?
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...
ATAL
2009
Springer
14 years 2 months ago
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
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...
James Pita, Manish Jain, Fernando Ordó&ntil...
ACMICEC
2003
ACM
87views ECommerce» more  ACMICEC 2003»
14 years 26 days ago
A comparison of two algorithms for multi-unit k-double auctions
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 ...
Shengli Bao, Peter R. Wurman
CORR
2008
Springer
63views Education» more  CORR 2008»
13 years 7 months ago
Two Remarkable Computational Competencies of the Simple Genetic Algorithm
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...
Keki M. Burjorjee