Sciweavers

1536 search results - page 41 / 308
» Approximately Dominating Representatives
Sort
View
FSTTCS
2003
Springer
14 years 29 days ago
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. The...
Nikhil R. Devanur, Vijay V. Vazirani
ESANN
2007
13 years 9 months ago
Replacing eligibility trace for action-value learning with function approximation
The eligibility trace is one of the most used mechanisms to speed up reinforcement learning. Earlier reported experiments seem to indicate that replacing eligibility traces would p...
Kary Främling
WAOA
2004
Springer
127views Algorithms» more  WAOA 2004»
14 years 1 months ago
Better Bounds for Minimizing SONET ADMs
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
Leah Epstein, Asaf Levin
ICPR
2008
IEEE
14 years 2 months ago
Fast approximate kernel-based similarity search for image retrieval task
In content based image retrieval, the success of any distance-based indexing scheme depends critically on the quality of the chosen distance metric. We propose in this paper a ker...
David Gorisse, Matthieu Cord, Frédér...
ISMVL
1994
IEEE
124views Hardware» more  ISMVL 1994»
13 years 12 months ago
Approximating Propositional Calculi by Finite-Valued Logics
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
Matthias Baaz, Richard Zach