Sciweavers

52 search results - page 9 / 11
» Approximate Convex Optimization by Online Game Playing
Sort
View
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 9 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
GECCO
2006
Springer
141views Optimization» more  GECCO 2006»
13 years 11 months ago
Coevolution of neural networks using a layered pareto archive
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
German A. Monroy, Kenneth O. Stanley, Risto Miikku...
NEUROSCIENCE
2001
Springer
13 years 12 months ago
Role of the Cerebellum in Time-Critical Goal-Oriented Behaviour: Anatomical Basis and Control Principle
The Brain is a slow computer yet humans can skillfully play games such as tennis where very fast reactions are required. Of particular interest is the evidence for strategic thinki...
Guido Bugmann
CVPR
2008
IEEE
14 years 1 months ago
Scene understanding with discriminative structured prediction
Spatial priors play crucial roles in many high-level vision tasks, e.g. scene understanding. Usually, learning spatial priors relies on training a structured output model. In this...
Jinhui Yuan, Jianmin Li, Bo Zhang
ATAL
2008
Springer
13 years 9 months ago
MB-AIM-FSI: a model based framework for exploiting gradient ascent multiagent learners in strategic interactions
Future agent applications will increasingly represent human users autonomously or semi-autonomously in strategic interactions with similar entities. Hence, there is a growing need...
Doran Chakraborty, Sandip Sen