Sciweavers

13376 search results - page 368 / 2676
» Problem Solving with
Sort
View
AAAI
2006
15 years 6 months ago
Efficient L1 Regularized Logistic Regression
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...
IPL
2007
107views more  IPL 2007»
15 years 4 months ago
Flows in dynamic networks with aggregate arc capacities
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...
Vardges Melkonian
EMO
2009
Springer
235views Optimization» more  EMO 2009»
15 years 11 months ago
Bi-objective Optimization for the Vehicle Routing Problem with Time Windows: Using Route Similarity to Enhance Performance
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...
Abel Garcia-Najera, John A. Bullinaria
148
Voted
ATAL
2006
Springer
15 years 8 months ago
Distributed Lagrangean relaxation protocol for the generalized mutual assignment problem
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...
Katsutoshi Hirayama
INFORMATICALT
2007
104views more  INFORMATICALT 2007»
15 years 4 months ago
Key Agreement Protocol (KAP) Using Conjugacy and Discrete Logarithm Problems in Group Representation Level
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 ...