Sciweavers

187 search results - page 32 / 38
» Optimal strategies in sequential bidding
Sort
View
FPCA
1995
15 years 1 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong
AAAI
2006
14 years 11 months ago
Boosting Expert Ensembles for Rapid Concept Recall
Many learning tasks in adversarial domains tend to be highly dependent on the opponent. Predefined strategies optimized for play against a specific opponent are not likely to succ...
Achim Rettinger, Martin Zinkevich, Michael H. Bowl...
ACCV
2009
Springer
15 years 4 months ago
A Dynamic Programming Approach to Maximizing Tracks for Structure from Motion
We present a novel algorithm for improving the accuracy of structure from motion on video sequences. Its goal is to efficiently recover scene structure and camera pose by using dyn...
Jonathan Mooser, Suya You, Ulrich Neumann, Raphael...
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
15 years 1 months ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding
NIPS
2003
14 years 11 months ago
Decoding V1 Neuronal Activity using Particle Filtering with Volterra Kernels
Decoding is a strategy that allows us to assess the amount of information neurons can provide about certain aspects of the visual scene. In this study, we develop a method based o...
Ryan Kelly, Tai Sing Lee