Sciweavers

5624 search results - page 219 / 1125
» On Conditional Covering Problem
Sort
View
EOR
2006
73views more  EOR 2006»
15 years 6 months ago
Enforcing minimum run length in the cutting stock problem
Deckling, cutting stock or trim loss problems arise when small units are to be fitted into large ones. One aims to reduce stock usage and setups, then favors long runs, surplus ov...
Adolf Diegel, Garth Miller, Edouard Montocchio, Si...
JIRS
2006
74views more  JIRS 2006»
15 years 6 months ago
Exploratory Navigation Based on Dynamical Boundary Value Problems
The paper presents a general framework for concurrent navigation and exploration of unknown environments based on discrete potential fields that guide the robot motion. These poten...
Marcelo Trevisan, Marco Aurélio Pires Idiar...
JC
2007
94views more  JC 2007»
15 years 6 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
SIAMJO
2002
89views more  SIAMJO 2002»
15 years 6 months ago
A Probability-One Homotopy Algorithm for Nonsmooth Equations and Mixed Complementarity Problems
A probability-one homotopy algorithm for solving nonsmooth equations is described. This algorithm is able to solve problems involving highly nonlinear equations, where the norm of ...
Stephen C. Billups, Layne T. Watson
CORR
2010
Springer
175views Education» more  CORR 2010»
15 years 1 months ago
On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
Yi Gai, Bhaskar Krishnamachari, Mingyan Liu