Sciweavers

449 search results - page 31 / 90
» Intention-Disguised Algorithmic Trading
Sort
View
GLOBECOM
2006
IEEE
15 years 3 months ago
Evaluation of Dynamic Query Abolishment Methods in Heterogeneous Networks
— We compare the performance of various dynamic query abolishment mechanisms in different unstructured overlay network topologies such as found in several P2P systems. We speci...
Elena Meshkova, Janne Riihijärvi, Petri M&aum...
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...
SEMWEB
2004
Springer
15 years 3 months ago
QOM - Quick Ontology Mapping
(Semi-)automatic mapping — also called (semi-)automatic alignment — of ontologies is a core task to achieve interoperability when two agents or services use different ontologie...
Marc Ehrig, Steffen Staab
SIGGRAPH
1999
ACM
15 years 2 months ago
Automatic Image Placement to Provide a Guaranteed Frame Rate
We present a preprocessing algorithm and run-time system for rendering 3D geometric models at a guaranteed frame rate. Our approach trades off space for frame rate by using images...
Daniel G. Aliaga, Anselmo Lastra
JMLR
2010
125views more  JMLR 2010»
14 years 4 months ago
Regret Bounds for Gaussian Process Bandit Problems
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
Steffen Grünewälder, Jean-Yves Audibert,...