Sciweavers

806 search results - page 144 / 162
» Lower Bounds on Correction Networks
Sort
View
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
14 years 8 days ago
Reinforcement learning for games: failures and successes
We apply CMA-ES, an evolution strategy with covariance matrix adaptation, and TDL (Temporal Difference Learning) to reinforcement learning tasks. In both cases these algorithms se...
Wolfgang Konen, Thomas Bartz-Beielstein
IPPS
2000
IEEE
14 years 1 days ago
Sorting on the OTIS-Mesh
In this paper we present sorting algorithms on the recently introduced N2 processor OTIS-Mesh, a network with diameter 4 p N , 3 consisting of N connected meshes of size p N  p N...
Andre Osterloh
CCS
2006
ACM
13 years 11 months ago
Can machine learning be secure?
Machine learning systems offer unparalled flexibility in dealing with evolving input in a variety of applications, such as intrusion detection systems and spam e-mail filtering. H...
Marco Barreno, Blaine Nelson, Russell Sears, Antho...
CIKM
2006
Springer
13 years 11 months ago
Distributed spatio-temporal similarity search
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
Demetrios Zeinalipour-Yazti, Song Lin, Dimitrios G...
PODC
1998
ACM
13 years 11 months ago
Optimal Efficiency of Optimistic Contract Signing
A contract is a non-repudiable agreement on a given contract text, i.e., a contract can be used to prove agreement between its signatories to any verifier. A contract signing sche...
Birgit Pfitzmann, Matthias Schunter, Michael Waidn...