Sciweavers

266 search results - page 31 / 54
» Solving Very Large Crew Scheduling Problems to Optimality
Sort
View
COLT
2004
Springer
14 years 4 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
EMMCVPR
2011
Springer
12 years 10 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
ISCAS
2003
IEEE
91views Hardware» more  ISCAS 2003»
14 years 4 months ago
SDP for multi-criterion QMF bank design
Quadraturemirror filter(QMF)bank with multi-criterion constraints suchas minimal aliasing and/or minimal error coding is amongthe most important problems in filter bank design, fo...
H. D. Tuan, L. H. Nam, H. Tuy, T. Q. Nguyen
INFOCOM
2009
IEEE
14 years 5 months ago
Multi-VPN Optimization for Scalable Routing via Relaying
—Enterprise networks are increasingly adopting Layer 3 Multiprotocol Label Switching (MPLS) Virtual Private Network (VPN) technology to connect geographically disparate locations...
MohammadHossein Bateni, Alexandre Gerber, Mohammad...
ICML
2002
IEEE
14 years 11 months ago
Learning from Scarce Experience
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
Leonid Peshkin, Christian R. Shelton