Sciweavers

9842 search results - page 69 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
EOR
2008
159views more  EOR 2008»
13 years 7 months ago
A survey on the continuous nonlinear resource allocation problem
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
Michael Patriksson
CORR
2012
Springer
216views Education» more  CORR 2012»
12 years 3 months ago
Fractional Moments on Bandit Problems
Reinforcement learning addresses the dilemma between exploration to find profitable actions and exploitation to act according to the best observations already made. Bandit proble...
Ananda Narayanan B., Balaraman Ravindran
AAAI
2004
13 years 9 months ago
The U.S. National Football League Scheduling Problem
We describe the problem of scheduling the television broadcasts of the U.S. National Football League (NFL). Unlike traditional round-robin tournament scheduling, the NFL problem i...
Bistra N. Dilkina, William S. Havens
DAM
2006
116views more  DAM 2006»
13 years 7 months ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
MP
2008
101views more  MP 2008»
13 years 7 months ago
Accelerating the cubic regularization of Newton's method on convex problems
In this paper we propose an accelerated version of the cubic regularization of Newton's method [6]. The original version, used for minimizing a convex function with Lipschitz...
Yu. Nesterov