Sciweavers

16430 search results - page 2974 / 3286
» On Computable Tree Functions
Sort
View
MST
2002
152views more  MST 2002»
15 years 6 months ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir
NN
1998
Springer
102views Neural Networks» more  NN 1998»
15 years 6 months ago
Modeling parietal-premotor interactions in primate control of grasping
Visual information is processed in the posterior parietal cortex for the hypothesized purpose of extracting a variety of affordances for the generation of motor behavior. The term...
Andrew H. Fagg, Michael A. Arbib
NN
1998
Springer
15 years 6 months ago
Statistical estimation of the number of hidden units for feedforward neural networks
The number of required hidden units is statistically estimated for feedforward neural networks that are constructed by adding hidden units one by one. The output error decreases w...
Osamu Fujita
STTT
1998
130views more  STTT 1998»
15 years 6 months ago
The Practitioner's Guide to Coloured Petri Nets
Abstract. Coloured Petri nets (CP-nets or CPNs) provide a framework for the design, specification, validation, and verification of systems. CP-nets have a wide range of applicati...
Lars Michael Kristensen, Søren Christensen,...
259
Voted
TIP
1998
128views more  TIP 1998»
15 years 6 months ago
Multigrid anisotropic diffusion
Abstract—A multigrid anisotropic diffusion algorithm for image processing is presented. The multigrid implementation provides an efficient hierarchical relaxation method that fa...
Scott T. Acton
« Prev « First page 2974 / 3286 Last » Next »