Sciweavers

3155 search results - page 601 / 631
» Maintenance: Less Is Not More
Sort
View
BMCBI
2007
153views more  BMCBI 2007»
13 years 8 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar
IOR
2008
128views more  IOR 2008»
13 years 8 months ago
Promised Lead-Time Contracts Under Asymmetric Information
We study the important problem of how a supplier should optimally share the consequences of demand uncertainty (i.e., the cost of inventory excesses and shortages) with a retailer...
Holly Lutze, Özalp Özer
COMCOM
2007
82views more  COMCOM 2007»
13 years 8 months ago
On application-level load balancing in FastReplica
— In the paper, we consider the problem of distributing large-size content to a fixed set of nodes. In contrast with the most existing end-system solutions to this problem, Fast...
Jangwon Lee, Gustavo de Veciana
IJON
2006
109views more  IJON 2006»
13 years 8 months ago
Integrating the improved CBP model with kernel SOM
In this paper, we first design a more generalized network model, Improved CBP, based on the same structure as Circular BackPropagation (CBP) proposed by Ridella et al. The novelty ...
Qun Dai, Songcan Chen
CORR
2007
Springer
173views Education» more  CORR 2007»
13 years 8 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge