Sciweavers

3416 search results - page 671 / 684
» Can Machines Learn Logics
Sort
View
COLT
2005
Springer
14 years 3 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
COLT
2004
Springer
14 years 3 months ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
H. Brendan McMahan, Avrim Blum
IFIP
2004
Springer
14 years 3 months ago
The Inherent Queuing Delay of Parallel Packet Switches
The parallel packet switch (PPS) extends the inverse multiplexing architecture, and is extensively used as the core of contemporary commercial switches. A key factor in the perfor...
Hagit Attiya, David Hay
UPP
2004
Springer
14 years 3 months ago
Inverse Design of Cellular Automata by Genetic Algorithms: An Unconventional Programming Paradigm
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
Thomas Bäck, Ron Breukelaar, Lars Willmes
WKDD
2010
CPS
204views Data Mining» more  WKDD 2010»
14 years 3 months ago
A Scalable, Accurate Hybrid Recommender System
—Recommender systems apply machine learning techniques for filtering unseen information and can predict whether a user would like a given resource. There are three main types of...
Mustansar Ali Ghazanfar, Adam Prügel-Bennett