Sciweavers

886 search results - page 76 / 178
» Generalized Bezout Identity
Sort
View
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
13 years 9 months ago
Biased Skip Lists
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi, 1 i n, the time to access item i is O...
Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goo...
ANOR
2005
124views more  ANOR 2005»
13 years 9 months ago
On Compact Formulations for Integer Programs Solved by Column Generation
Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subprobl...
Daniel Villeneuve, Jacques Desrosiers, Marco E. L&...
IOR
2007
82views more  IOR 2007»
13 years 9 months ago
Compensating for Failures with Flexible Servers
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
Sigrún Andradóttir, Hayriye Ayhan, D...
IJON
2000
71views more  IJON 2000»
13 years 9 months ago
Variable selection using neural-network models
In this paper we propose an approach to variable selection that uses a neural-network model as the tool to determine which variables are to be discarded. The method performs a bac...
Giovanna Castellano, Anna Maria Fanelli
QUESTA
2007
92views more  QUESTA 2007»
13 years 8 months ago
Estimation for queues from queue length data
We consider the estimation of arrival and service rates for queues based on queue length data collected at successive, not necessarily equally spaced, time points. In particular, ...
J. V. Ross, T. Taimre, Philip K. Pollett