Sciweavers

4047 search results - page 231 / 810
» The Discrete Basis Problem
Sort
View
SODA
1997
ACM
106views Algorithms» more  SODA 1997»
15 years 5 months ago
Optimal Bounds for Matching Routing on Trees
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
Louxin Zhang
134
Voted
IANDC
2008
111views more  IANDC 2008»
15 years 4 months ago
Bin packing with controllable item sizes
We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an a...
José R. Correa, Leah Epstein
EOR
2006
97views more  EOR 2006»
15 years 4 months ago
Bayesian portfolio selection with multi-variate random variance models
We consider multi-period portfolio selection problems for a decision maker with a specified utility function when the variance of security returns is described by a discrete time ...
Refik Soyer, Kadir Tanyeri
JAT
2008
100views more  JAT 2008»
15 years 4 months ago
Direct and inverse results in variable Hilbert scales
Variable Hilbert scales are an important tool for the recent analysis of inverse problems in Hilbert spaces, as these constitute a way to describe smoothness of objects other than ...
Peter Mathé, Bernd Hofmann
COMPUTING
1998
69views more  COMPUTING 1998»
15 years 4 months ago
Multilevel Norms for H-1/2
We give some estimates related to nite element multilevel splittings and Sobolev norms of negative order. Basically, results for the positive order case are carried over by dualit...
P. Oswald