10493 search results - page 1404 / 2099 » Dynamic Word Problems |
161
click to vote
COR
2010
15 years 7 months ago
2010
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
169
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
: Problem statement: Term extraction is one of the layers in the ontology development process which has the task to extract all the terms contained in the input document automatica...
163
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
151
click to vote
COR
2008
15 years 7 months ago
2008
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
181
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. We formalize the robustness of state probabilities to re...