L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
Su-In Lee, Honglak Lee, Pieter Abbeel, Andrew Y. N...
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
Eligijus Sakalauskas, Povilas Tvarijonas, Andrius ...