Sciweavers

908 search results - page 27 / 182
» Interactive regret minimization
Sort
View
IPPS
2006
IEEE
15 years 8 months ago
Memory minimization for tensor contractions using integer linear programming
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...
A. Allam, J. Ramanujam, Gerald Baumgartner, P. Sad...
105
Voted
COLT
2004
Springer
15 years 7 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
JACM
2006
93views more  JACM 2006»
15 years 1 months ago
Combining expert advice in reactive environments
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...
Daniela Pucci de Farias, Nimrod Megiddo
JSAC
2008
125views more  JSAC 2008»
15 years 1 months ago
Optimal Competitive Algorithms for Opportunistic Spectrum Access
We consider opportunistic spectrum access (OSA) strategies for a transmitter in a multichannel wireless system, where a channel may or may not be available and the transmitter must...
Nicholas B. Chang, Mingyan Liu
113
Voted
CEC
2003
IEEE
15 years 5 months ago
Genome-physics interaction as a new concept to reduce the number of genetic parameters in artificial evolution
This paper reports on investigations on the possible advantage of the coupling between genomes and physics of cells in artificial evolution. The idea is simple: evolution can rely ...
Peter Eggenberger Hotz