Sciweavers

6110 search results - page 165 / 1222
» Approximate Computing
Sort
View
189
Voted
WINE
2007
Springer
161views Economy» more  WINE 2007»
16 years 1 months ago
New Algorithms for Approximate Nash Equilibria in Bimatrix Games
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
Hartwig Bosse, Jaroslaw Byrka, Evangelos Markakis
ICCAD
2004
IEEE
107views Hardware» more  ICCAD 2004»
16 years 4 months ago
Computation of signal threshold crossing times directly from higher order moments
—This paper introduces a simple method for calculating the times at which any signal crosses a prespecified threshold voltage (e.g., 10%, 20%, 50%, etc.) directly from the moment...
Yehea I. Ismail, Chirayu S. Amin
CEC
2008
IEEE
16 years 1 months ago
A parallel surrogate-assisted multi-objective evolutionary algorithm for computationally expensive optimization problems
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
Anna Syberfeldt, Henrik Grimm, Amos Ng, Robert Ivo...
IJFCS
2002
58views more  IJFCS 2002»
15 years 6 months ago
Vector Algorithms for Approximate String Matching
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
Anne Bergeron, Sylvie Hamel
CIDR
2003
134views Algorithms» more  CIDR 2003»
15 years 8 months ago
Approximate Range Selection Queries in Peer-to-Peer Systems
We present an architecture for a data sharing peer-to-peer system where the data is shared in the form of database relations. In general, peer-to-peer systems try to locate exactm...
Abhishek Gupta, Divyakant Agrawal, Amr El Abbadi