1578 search results - page 235 / 316 » Direct Routing: Algorithms and Complexity |
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...
IPSN
2007
Springer
14 years 4 months ago
2007
Springer
Energy-efficient image communication is one of the most important goals for a large class of current and future sensor network applications. This paper presents a quantitative com...
ARITH
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
CRV
2005
IEEE
14 years 3 months ago
2005
IEEE
The extraction of optimal features, in a classification sense, is still quite challenging in the context of large-scale classification problems (such as visual recognition), inv...
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
Recurrent neural networks are theoretically capable of learning complex temporal sequences, but training them through gradient-descent is too slow and unstable for practical use i...