Sciweavers

541 search results - page 12 / 109
» Factoring Solution Sets of Polynomial Systems in Parallel
Sort
View
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
14 years 11 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
AIPS
2011
14 years 1 months ago
A Polynomial All Outcome Determinization for Probabilistic Planning
Most predominant approaches in probabilistic planning utilize techniques from the more thoroughly investigated field of classical planning by determinizing the problem at hand. I...
Thomas Keller, Patrick Eyerich
ICML
2009
IEEE
15 years 10 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
ASPLOS
2010
ACM
15 years 4 months ago
Accelerating the local outlier factor algorithm on a GPU for intrusion detection systems
The Local Outlier Factor (LOF) is a very powerful anomaly detection method available in machine learning and classification. The algorithm defines the notion of local outlier in...
Malak Alshawabkeh, Byunghyun Jang, David R. Kaeli
SIGIR
2011
ACM
14 years 8 days ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...