Sciweavers

2370 search results - page 185 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
53
Voted
WDAG
2005
Springer
77views Algorithms» more  WDAG 2005»
15 years 3 months ago
Restricted Stack Implementations
We introduce a new object, BH, and prove that a system with one BH object and single-writer Registers has the same computational power as a system with countably many commutative a...
Matei David, Alex Brodsky, Faith Ellen Fich
70
Voted
WEA
2005
Springer
91views Algorithms» more  WEA 2005»
15 years 3 months ago
The Necessity of Timekeeping in Adversarial Queueing
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
Maik Weinard
GECCO
2004
Springer
15 years 3 months ago
Subthreshold-Seeking Behavior and Robust Local Search
Subthreshold-seeking behavior occurs when the majority of the points that an algorithm samples have an evaluation less than some target threshold. We characterize sets of functions...
L. Darrell Whitley, Keith Bush, Jonathan E. Rowe
95
Voted
ICBA
2004
Springer
180views Biometrics» more  ICBA 2004»
15 years 3 months ago
FVC2004: Third Fingerprint Verification Competition
A new technology evaluation of fingerprint verification algorithms has been organized following the approach of the previous FVC2000 and FVC2002 evaluations, with the aim of tracki...
Dario Maio, Davide Maltoni, Raffaele Cappelli, Jam...
81
Voted
ISAAC
2004
Springer
207views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Pareto Optimality in House Allocation Problems
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
David J. Abraham, Katarína Cechlárov...