Sciweavers

449 search results - page 64 / 90
» Intention-Disguised Algorithmic Trading
Sort
View
ATAL
2006
Springer
14 years 11 days ago
A novel method for automatic strategy acquisition in N-player non-zero-sum games
We present a novel method for automatically acquiring strategies for the double auction by combining evolutionary optimization together with a principled game-theoretic analysis. ...
Steve Phelps, Marek Marcinkiewicz, Simon Parsons
SGP
2007
13 years 11 months ago
Delaunay mesh construction
We present algorithms to produce Delaunay meshes from arbitrary triangle meshes by edge flipping and geometrypreserving refinement and prove their correctness. In particular we sh...
Ramsay Dyer, Hao Zhang 0002, Torsten Möller
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
13 years 10 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya
GIS
2009
ACM
14 years 9 months ago
Sea Floor Bathymetry Trackline Surface Fitting Without Visible Artifacts Using ODETLAP
High quality, artifact-free fitting a bathymetry (sea-floor) surface to very unevenly spaced depth data from ship tracklines is possible with ODETLAP (Overdetermined Laplacian Par...
Tsz-Yam Lau, W. Randolph Franklin, You Li, Zhongyi...
ICML
2006
IEEE
14 years 9 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman