Sciweavers

21324 search results - page 416 / 4265
» Making the case for computing
Sort
View
UAI
2004
15 years 7 months ago
Computing Best-Response Strategies in Infinite Games of Incomplete Information
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
Daniel M. Reeves, Michael P. Wellman
JPDC
2006
106views more  JPDC 2006»
15 years 6 months ago
Computing nearest neighbors in real time
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples in...
Marius Nagy, Selim G. Akl
DCG
2010
97views more  DCG 2010»
15 years 4 months ago
Cech Type Approach to Computing Homology of Maps
A new approach to algorithmic computation of the homology of spaces and maps is presented. The key point of the approach is a change in the representation of sets. The proposed rep...
Marian Mrozek
AMC
2007
86views more  AMC 2007»
15 years 6 months ago
Further refinement of pairing computation based on Miller's algorithm
In 2006, Blake, Murty and Xu proposed three refinements to Miller’s algorithm for computing Weil/Tate Pairings. In this paper we extend their work and propose a generalized algo...
Chao-Liang Liu, Gwoboa Horng, Te-Yu Chen
CORR
2006
Springer
101views Education» more  CORR 2006»
15 years 6 months ago
Fast computation of power series solutions of systems of differential equations
We propose algorithms for the computation of the first N terms of a vector (or a full basis) of power series solutions of a linear system of differential equations at an ordinary ...
Alin Bostan, Frédéric Chyzak, Fran&c...