Sciweavers

934 search results - page 94 / 187
» exact 2007
Sort
View
EOR
2007
90views more  EOR 2007»
15 years 4 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
EOR
2007
111views more  EOR 2007»
15 years 4 months ago
A pegging approach to the precedence-constrained knapsack problem
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proï...
Byungjun You, Takeo Yamada
IJON
2007
79views more  IJON 2007»
15 years 3 months ago
Predicting neuronal activity with simple models of the threshold type: Adaptive Exponential Integrate-and-Fire model with two co
An adaptive Exponential Integrate-and-Fire (aEIF) model was used to predict the activity of layer-V-pyramidal neurons of rat neocortex under random current injection. A new protoc...
Claudia Clopath, Renaud Jolivet, Alexander Rauch, ...
INFORMATICALT
2007
75views more  INFORMATICALT 2007»
15 years 3 months ago
An Effective Method for Initialization of Lloyd-Max's Algorithm of Optimal Scalar Quantization for Laplacian Source
Abstract. In this paper an exact and complete analysis of the Lloyd–Max’s algorithm and its initialization is carried out. An effective method for initialization of Lloyd–Max...
Zoran Peric, Jelena Nikolic
IPL
2007
81views more  IPL 2007»
15 years 3 months ago
Linear-time algorithms for problems on planar graphs with fixed disk dimension
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
Faisal N. Abu-Khzam, Michael A. Langston