Sciweavers

709 search results - page 76 / 142
» An Equational Theory for Transactions
Sort
View
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
15 years 11 months ago
Fast quantum algorithms for computing the unit group and class group of a number field
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
Sean Hallgren
CSE
2009
IEEE
15 years 6 months ago
Parallel Computation of Nash Equilibria in N-Player Games
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
Jonathan Widger, Daniel Grosu
CALCO
2007
Springer
118views Mathematics» more  CALCO 2007»
15 years 5 months ago
Free Modal Algebras: A Coalgebraic Perspective
In this paper we discuss a uniform method for constructing free modal and distributive modal algebras. This method draws on works by (Abramsky 2005) and (Ghilardi 1995). We revisit...
Nick Bezhanishvili, Alexander Kurz
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
15 years 5 months ago
Origin of bursts
The phenomenon of particle bursts, a well-known feature of PSO is investigated. Their origin is concluded to lie in multiplicative stochasticity, previously encountered in the stu...
Tim Blackwell, Daniel Bratton
LPAR
2005
Springer
15 years 4 months ago
Algebraic Intruder Deductions
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...
David A. Basin, Sebastian Mödersheim, Luca Vi...