An algorithm for time-adaptive quantile regression is presented. The algorithm is based on the simplex algorithm, and the linear optimization formulation of the quantile regressio...
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
In wireless ad hoc sensor networks, energy use is in many cases the most important constraint since it corresponds directly to operational lifetime. Topology management schemes su...
Quang Gao, Keith J. Blow, David J. Holding, Ian W....
Abstract Large temporal Databases (TDBs) usually contain a wealth of data about temporal events. Aimed at discovering temporal patterns with during relationship (during-temporal pa...